{"id":"https://openalex.org/W632099712","doi":null,"title":"Theoretical analysis of practical heuristics for satisfiability","display_name":"Theoretical analysis of practical heuristics for satisfiability","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W632099712","mag":"632099712"},"language":"en","primary_location":{"id":"pmh:oai:summit.sfu.ca:9868","doi":null,"is_oa":true,"landing_page_url":"http://summit.sfu.ca/item/9868","pdf_url":"http://summit.sfu.ca/item/9868","source":{"id":"https://openalex.org/S4306400490","display_name":"Summit (Simon Fraser University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I18014758","host_organization_name":"Simon Fraser University","host_organization_lineage":["https://openalex.org/I18014758"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://summit.sfu.ca/item/9868","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029127249","display_name":"Evgeny Skvortsov","orcid":"https://orcid.org/0009-0003-5011-3708","observed_orcids":["https://orcid.org/0009-0003-5011-3708"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Evgeny Skvortsov","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5029127249"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9965999722480774,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0008999999845400453,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.000699999975040555,"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/satisfiability","display_name":"satisfiability","score":0.8109999895095825},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.9049999713897705},{"id":"https://openalex.org/keywords/gsat","display_name":"GSAT","score":0.9810000061988831},{"id":"https://openalex.org/keywords/random-walks","display_name":"random walks","score":0.5899999737739563},{"id":"https://openalex.org/keywords/weighted-random-walk","display_name":"weighted random walk","score":0.9570000171661377},{"id":"https://openalex.org/keywords/phase-transitions","display_name":"phase transitions","score":0.7149999737739563},{"id":"https://openalex.org/keywords/clause-density","display_name":"clause density","score":0.7900000214576721},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.6399999856948853},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.42800000309944153}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7742199897766113},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6867228150367737},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.611288845539093},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5916879773139954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569959282875061},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5064800977706909},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45899325609207153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.421977698802948},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32759037613868713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29643404483795166}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:summit.sfu.ca:9868","doi":null,"is_oa":true,"landing_page_url":"http://summit.sfu.ca/item/9868","pdf_url":"http://summit.sfu.ca/item/9868","source":{"id":"https://openalex.org/S4306400490","display_name":"Summit (Simon Fraser University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I18014758","host_organization_name":"Simon Fraser University","host_organization_lineage":["https://openalex.org/I18014758"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:summit.sfu.ca:node-9868","doi":null,"is_oa":true,"landing_page_url":"https://summit.sfu.ca/_flysystem/fedora/sfu_migrate/9868/ETD4897.pdf","pdf_url":"https://summit.sfu.ca/_flysystem/fedora/sfu_migrate/9868/ETD4897.pdf","source":{"id":"https://openalex.org/S4306400490","display_name":"Summit (Simon Fraser University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I18014758","host_organization_name":"Simon Fraser University","host_organization_lineage":["https://openalex.org/I18014758"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"mag:632099712","doi":null,"is_oa":false,"landing_page_url":"https://ir.lib.sfu.ca/item/9868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:summit.sfu.ca:9868","doi":null,"is_oa":true,"landing_page_url":"http://summit.sfu.ca/item/9868","pdf_url":"http://summit.sfu.ca/item/9868","source":{"id":"https://openalex.org/S4306400490","display_name":"Summit (Simon Fraser University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I18014758","host_organization_name":"Simon Fraser University","host_organization_lineage":["https://openalex.org/I18014758"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320314997","display_name":"Strong","ror":"https://ror.org/041vyzr56"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W632099712.pdf","grobid_xml":"https://content.openalex.org/works/W632099712.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W4983232","https://openalex.org/W139325465","https://openalex.org/W242035403","https://openalex.org/W1482954786","https://openalex.org/W1500660230","https://openalex.org/W1513769081","https://openalex.org/W1520090510","https://openalex.org/W1527642385","https://openalex.org/W1559492868","https://openalex.org/W1564025554","https://openalex.org/W1571307015","https://openalex.org/W1590867284","https://openalex.org/W1591939288","https://openalex.org/W1597271110","https://openalex.org/W1608133301","https://openalex.org/W1616547254","https://openalex.org/W1638454426","https://openalex.org/W1667614912","https://openalex.org/W1820801893","https://openalex.org/W1963913579","https://openalex.org/W1979720612","https://openalex.org/W1983171306","https://openalex.org/W1985250014","https://openalex.org/W1985572324","https://openalex.org/W1994098212","https://openalex.org/W2000931246","https://openalex.org/W2001564241","https://openalex.org/W2001859357","https://openalex.org/W2017127020","https://openalex.org/W2019578639","https://openalex.org/W2029489766","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2053777090","https://openalex.org/W2054387247","https://openalex.org/W2057361103","https://openalex.org/W2068871408","https://openalex.org/W2075335084","https://openalex.org/W2087662271","https://openalex.org/W2088377032","https://openalex.org/W2100020751","https://openalex.org/W2101692976","https://openalex.org/W2128782263","https://openalex.org/W2135414548","https://openalex.org/W2136558174","https://openalex.org/W2139919528","https://openalex.org/W2155218845","https://openalex.org/W2158185647","https://openalex.org/W2164346692","https://openalex.org/W2171680292","https://openalex.org/W2295428206","https://openalex.org/W2526609438","https://openalex.org/W2584035095"],"related_works":["https://openalex.org/W1484932675","https://openalex.org/W1638454426","https://openalex.org/W18766686","https://openalex.org/W1562579417","https://openalex.org/W7099990500","https://openalex.org/W1700222499","https://openalex.org/W7100629256","https://openalex.org/W2156708389","https://openalex.org/W2087662271","https://openalex.org/W81610693"],"abstract_inverted_index":{"The":[0,188,311],"Satisfiability":[1],"problem":[2,17],"(SAT)":[3],"is":[4,49,73,87,212,313],"one":[5],"of":[6,10,32,36,53,70,78,119,135,138,167,181,234,248,270],"the":[7,51,54,60,79,88,120,136,139,160,224,226,235,292,322],"central":[8],"subjects":[9],"research":[11],"in":[12,201,342],"modern":[13,27],"computing":[14],"science.":[15],"This":[16,284],"provides":[18],"a":[19,115,132,244,306,317,338],"rich":[20],"language":[21],"to":[22,43,67,83,321],"model":[23],"practical":[24,55,99,191],"problems.":[25,46,109],"Moreover":[26],"SAT":[28,37,48,56,100],"solvers":[29,239],"are":[30,65,95],"capable":[31],"solving":[33],"large":[34],"instances":[35,166,180],"and":[38,174,206,240,261,289],"can":[39,265],"be":[40],"successfully":[41],"applied":[42],"industrial":[44],"scale":[45],"Since":[47],"NP-complete":[50,63],"success":[52],"algorithms":[57],"apparently":[58],"contradicts":[59],"belief":[61],"that":[62,131,263,275,295,330],"problems":[64],"hard":[66],"solve.":[68],"Understanding":[69],"this":[71,85,111,210,344],"phenomenon":[72,86],"far":[74],"from":[75],"complete.":[76],"One":[77],"most":[80],"promising":[81],"approaches":[82],"explaining":[84],"typical":[89,116],"case":[90,117],"analysis.":[91],"Local":[92,122,140,217,301],"search":[93,196,238,251],"principles":[94],"actively":[96],"used":[97],"for":[98,105,156,179,246,280,351],"solving,":[101],"as":[102,104],"well":[103,323],"many":[106],"other":[107],"important":[108],"In":[110,208],"work":[112],"we":[113,304],"perform":[114],"analysis":[118],"basic":[121,216],"Search":[123,141,218],"algorithm":[124,161,192,211,227,312,346],"on":[125,142,194,257],"Random":[126,143,258,267,308,325,332,348],"Planted":[127,144,259,268,349],"3-SAT.":[128],"We":[129,253,328],"show":[130,262],"phase":[133],"transition":[134],"effectiveness":[137],"3-SAT":[145,260,269,350],"occurs":[146],"at":[147],"density":[148,168,182,272],"\u03c1":[149,273,276],"=":[150],"7/6":[151],"ln":[152,172,278],"n.":[153,187],"That":[154],"is,":[155],"any":[157,271,352],"constant":[158,282,353],"\u03b5":[159,185],"with":[162,175,220,334],"high":[163,176,335],"probability":[164,177,336],"solves":[165,347],"(7/6":[169,183],"+":[170],"\u03b5)":[171],"n":[173,279],"fails":[178],"-":[184],")ln":[186],"first":[189],"successful":[190],"based":[193],"local":[195,250],"principles,":[197],"GSAT,":[198],"was":[199,228,231],"proposed":[200],"1991":[202],"by":[203,315],"Selman,":[204],"Levesque":[205],"Mitchell.":[207],"fact":[209],"nothing":[213],"more":[214],"than":[215],"enhanced":[219],"plateau":[221,297],"moves.":[222],"At":[223],"time":[225],"proposed,":[229],"it":[230,241,264],"outperforming":[232],"state":[233],"art":[236],"systematic":[237],"continues":[242],"serving":[243],"basis":[245],"development":[247],"efficient":[249],"algorithms.":[252],"analyze":[254],"GSAT":[255],"theoretically":[256],"solve":[266],"such":[274],">\u03ba":[277],"some":[281],"\u03ba.":[283],"theoretical":[285],"result":[286],"agrees":[287],"with,":[288],"partially":[290],"explains,":[291],"empirical":[293],"observation":[294],"adding":[296,316],"moves":[298],"dramatically":[299],"improves":[300],"Search.":[302],"Finally":[303],"propose":[305],"Weighted":[307,331],"Walk":[309,326,333],"algorithm.":[310,327],"obtained":[314],"simple":[318,345],"weighting":[319],"scheme":[320],"known":[324],"prove":[329],"gives":[337],"good":[339],"approximation.":[340],"Moreover,":[341],"experiments":[343],"density.":[354]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}