{"id":"https://openalex.org/W2026105979","doi":"https://doi.org/10.1142/s0129054105003182","title":"CASCADING RANDOM WALKS","display_name":"CASCADING RANDOM WALKS","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W2026105979","doi":"https://doi.org/10.1142/s0129054105003182","mag":"2026105979"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003182","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003182","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050337397","display_name":"K. Subramani","orcid":"https://orcid.org/0000-0001-5821-5117"},"institutions":[{"id":"https://openalex.org/I12097938","display_name":"West Virginia University","ror":"https://ror.org/011vxgd24","country_code":"US","type":"education","lineage":["https://openalex.org/I12097938"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. SUBRAMANI","raw_affiliation_strings":["LDCSEE, West Virginia University, Morgantown, West Virginia 26506, USA"],"affiliations":[{"raw_affiliation_string":"LDCSEE, West Virginia University, Morgantown, West Virginia 26506, USA","institution_ids":["https://openalex.org/I12097938"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5050337397"],"corresponding_institution_ids":["https://openalex.org/I12097938"],"apc_list":null,"apc_paid":null,"fwci":0.3514,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59845444,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"03","first_page":"599","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.8417531251907349},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6556827425956726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6334133148193359},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5417102575302124},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5331902503967285},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.48510921001434326},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.44212740659713745},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43990007042884827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4296911060810089},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.276580810546875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22482186555862427},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.2219604253768921}],"concepts":[{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.8417531251907349},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6556827425956726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6334133148193359},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5417102575302124},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5331902503967285},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.48510921001434326},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.44212740659713745},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43990007042884827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4296911060810089},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.276580810546875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22482186555862427},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2219604253768921},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054105003182","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003182","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320321409","display_name":"Aalborg Universitet","ror":"https://ror.org/04m5j1k67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W14839205","https://openalex.org/W105001474","https://openalex.org/W282603215","https://openalex.org/W1487752181","https://openalex.org/W1507596338","https://openalex.org/W1571893670","https://openalex.org/W1593296518","https://openalex.org/W1601935780","https://openalex.org/W1667614912","https://openalex.org/W1820801893","https://openalex.org/W1964809718","https://openalex.org/W2003160050","https://openalex.org/W2006146932","https://openalex.org/W2011039300","https://openalex.org/W2014111643","https://openalex.org/W2019363670","https://openalex.org/W2031823362","https://openalex.org/W2036265926","https://openalex.org/W2066749637","https://openalex.org/W2082757215","https://openalex.org/W2089290774","https://openalex.org/W2102140349","https://openalex.org/W2105761964","https://openalex.org/W2126442135","https://openalex.org/W2134514766","https://openalex.org/W2138304862","https://openalex.org/W2166566648","https://openalex.org/W2229615128","https://openalex.org/W2295428206","https://openalex.org/W4213009134","https://openalex.org/W4231393247","https://openalex.org/W4231916799","https://openalex.org/W4238893454"],"related_works":["https://openalex.org/W138251527","https://openalex.org/W2067983896","https://openalex.org/W3107131366","https://openalex.org/W53412747","https://openalex.org/W2590445006","https://openalex.org/W2741679812","https://openalex.org/W4301514548","https://openalex.org/W2963321374","https://openalex.org/W2610304232","https://openalex.org/W1656268799"],"abstract_inverted_index":{"In":[0],"this":[1,147,170,343,367],"paper,":[2],"we":[3],"discuss":[4],"a":[5,16,34,60,74,79,84,97,100,155,217,229,242,272,292,304,308,350,375],"simple,":[6],"Monte":[7],"Carlo":[8],"algorithm":[9,145,224,253,288,306,373],"for":[10,99,123,146,166,190,307,348,374],"the":[11,55,68,88,115,126,135,142,152,161,173,182,191,202,214,222,266,276,280,284,314,317,330,346,370],"problem":[12,56,94,120,128,193],"of":[13,57,90,95,154,176,181,216,303,332,352,377],"checking":[14,58,333],"whether":[15,59],"Quantified":[17],"Boolean":[18],"Formula":[19],"(QBF)":[20],"in":[21,45,103,132,139,169,198,200,213,255,342,366],"Conjunctive":[22],"Normal":[23],"Form":[24],"(CNF),":[25],"with":[26,47,105,233,245],"at":[27,48,106,107,210],"most":[28,49,108],"two":[29],"literals":[30,51,110],"per":[31,52,111],"clause":[32,53,112],"has":[33],"model.":[35],"The":[36,93,118,299,338],"term":[37],"k-CNF":[38,62],"is":[39,64,66,73,113,121,141,195,265,282,294,310,369],"used":[40],"to":[41,160,269,290,323,355],"describe":[42],"boolean":[43,75],"formulas":[44,357],"CNF,":[46,104],"k":[50,109],"and":[54,164,237,301,316,326,358],"given":[61,273],"formula":[63,102,163],"satisfiable":[65],"called":[67,114],"k-SAT":[69],"problem.":[70,117,148],"A":[71],"QBF":[72,101],"formula,":[76],"accompanied":[77],"by":[78],"quantifier":[80],"string":[81],"which":[82],"imposes":[83],"linear":[85],"ordering":[86],"on":[87,248],"variables":[89],"that":[91,194,201,221,271,286,363],"formula.":[92,277],"finding":[96],"model":[98,274,293],"QkSAT":[116,119],"PSPACE-complete,":[122],"k\u22653.":[124],"However,":[125],"Q2SAT":[127,192,243],"can":[129,225],"be":[130,179,208,226,324],"decided":[131],"polynomial":[133],"time;":[134],"graph-based":[136],"procedure,":[137],"discussed":[138,341],"[1],":[140],"first":[143,371],"such":[144],"This":[149],"procedure":[150],"requires":[151],"construction":[153],"global":[156],"implication":[157],"graph,":[158],"corresponding":[159],"input":[162],"searching":[165],"certain":[167],"paths":[168],"graph.":[171],"Hence":[172],"complete":[174,203],"set":[175,205],"clauses":[177,247],"must":[178],"part":[180],"input.":[183],"We":[184,219,361],"propose":[185],"an":[186],"incremental,":[187],"randomized":[188,223,305,339,372],"approach":[189,340],"essentially":[196],"local":[197],"nature,":[199],"clausal":[204],"need":[206],"not":[207],"provided":[209],"any":[211],"time,":[212],"presence":[215],"verifier.":[218],"show":[220],"analyzed":[227],"as":[228,336],"one-dimensional":[230],"random":[231],"walk,":[232],"one":[234,238,297],"reflecting":[235],"barrier":[236],"absorbing":[239],"barrier.":[240],"On":[241],"instance":[244,281],"m":[246],"n":[249],"variables,":[250],"our":[251,287,364],"coin-flipping":[252],"runs":[254],"time":[256,267],"O(n":[257],"2":[258],"\u00b7":[259],"V(m,":[260,263],"n)),":[261],"where":[262],"n)":[264],"required":[268],"verify":[270],"satisfies":[275],"Additionally,":[278],"if":[279],"satisfiable,":[283],"probability":[285],"fails":[289],"find":[291],"less":[295],"than":[296],"half.":[298],"design":[300],"analysis":[302],"problem,":[309],"important":[311],"from":[312],"both":[313],"theoretical":[315],"practical":[318],"perspectives.":[319],"Randomized":[320],"approaches":[321],"tend":[322],"simple":[325],"elegant,":[327],"thereby":[328],"making":[329],"process":[331],"correctness,":[334],"effortless":[335],"well.":[337],"paper":[344,368],"lays":[345],"groundwork":[347],"analyzing":[349],"number":[351],"problems":[353],"related":[354],"2CNF":[356],"directed":[359],"graphs.":[360],"remark":[362],"work":[365],"class":[376],"QBFs.":[378]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}