{"id":"https://openalex.org/W264823163","doi":"https://doi.org/10.1137/s0097539792228629","title":"A Complexity Index for Satisfiability Problems","display_name":"A Complexity Index for Satisfiability Problems","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W264823163","doi":"https://doi.org/10.1137/s0097539792228629","mag":"264823163"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792228629","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792228629","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5057621825","display_name":"Endre Boros","orcid":"https://orcid.org/0000-0001-8206-3168"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. Boros","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038958909","display_name":"Yves Crama","orcid":"https://orcid.org/0000-0002-7470-4743"},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Y. Crama","raw_affiliation_strings":["Universit\u00e9 de Li\u00e8ge - ULi\u00e8ge > HEC Li\u00e8ge : UER > Recherche op\u00e9rationnelle et gestion de la production >"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Li\u00e8ge - ULi\u00e8ge > HEC Li\u00e8ge : UER > Recherche op\u00e9rationnelle et gestion de la production >","institution_ids":["https://openalex.org/I157674565"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108282938","display_name":"Peter L. Hammer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. L. Hammer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Saks","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057621825"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02286024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"1","first_page":"45","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9854999780654907,"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.9854999780654907,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9722999930381775,"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.9516000151634216,"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.7511860132217407},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6770544052124023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.663520097732544},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6632601022720337},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.6118354797363281},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5896725058555603},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5890130996704102},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5159702897071838},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.4976098835468292},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4697166979312897},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4651568531990051},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4458690583705902},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4164600968360901},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.35480475425720215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22678762674331665},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1919536590576172}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7511860132217407},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6770544052124023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.663520097732544},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6632601022720337},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.6118354797363281},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5896725058555603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5890130996704102},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5159702897071838},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.4976098835468292},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4697166979312897},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4651568531990051},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4458690583705902},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4164600968360901},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.35480475425720215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22678762674331665},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1919536590576172},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539792228629","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792228629","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11664882260004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/A-complexity-index-for-satisfiability-problems/991031665204604646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/217333","is_oa":false,"landing_page_url":"https://orbi.uliege.be/handle/2268/217333","pdf_url":null,"source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 23, 45-49 (1994)","raw_type":"peer reviewed"},{"id":"mag:264823163","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/ipco/ipco1992.html#BorosCHS92","pdf_url":null,"source":{"id":"https://openalex.org/S4306418923","display_name":"Integer Programming and Combinatorial Optimization","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Integer Programming and Combinatorial Optimization","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1981549588","https://openalex.org/W1999647826","https://openalex.org/W2003160050","https://openalex.org/W2011992362","https://openalex.org/W2021929022","https://openalex.org/W2031823362","https://openalex.org/W2165144647"],"related_works":["https://openalex.org/W890352905","https://openalex.org/W2009777252","https://openalex.org/W2095678014","https://openalex.org/W2140202836","https://openalex.org/W2119615542","https://openalex.org/W1563026540","https://openalex.org/W2092928619","https://openalex.org/W2900560989","https://openalex.org/W2159892713","https://openalex.org/W1590274425","https://openalex.org/W2154474334","https://openalex.org/W1979831715","https://openalex.org/W2944997627","https://openalex.org/W2128782263","https://openalex.org/W2009029764","https://openalex.org/W2062843268","https://openalex.org/W3082581272","https://openalex.org/W2952190520","https://openalex.org/W2949523893","https://openalex.org/W2972401921"],"abstract_inverted_index":{"This":[0],"paper":[1],"associates":[2],"a":[3,64],"linear":[4],"programming":[5],"problem":[6],"(LP)":[7],"to":[8,90],"any":[9,78],"conjunctive":[10],"normal":[11],"form":[12],"$\\phi":[13],"$,":[14],"and":[15],"shows":[16],"that":[17,44],"the":[18,27,30,50,71,91],"optimum":[19],"value":[20],"$Z(\\phi":[21,56,97],")$":[22],"of":[23,29,52,73,93],"this":[24],"LP":[25],"measures":[26],"complexity":[28],"corresponding":[31],"${\\textit{SAT}}$":[32,43],"(Boolean":[33],"satisfiability)":[34],"problem.":[35],"More":[36],"precisely,":[37],"there":[38],"is":[39,70,84],"an":[40],"algorithm":[41],"for":[42,63,77,95],"runs":[45],"in":[46],"polynomial":[47],"time":[48],"on":[49],"class":[51,92],"satisfiability":[53],"problems":[54],"satisfying":[55],")":[57,98],"\\leqslant":[58,99],"1":[59,100],"+":[60,101],"\\tfrac{{c\\log":[61],"n}}{n}$":[62],"fixed":[65,79],"constant":[66],"c,":[67],"where":[68],"c":[69],"number":[72],"variables.":[74],"In":[75],"contrast,":[76],"$\\beta":[80],"<":[81],"1$,":[82],"$SAT$":[83],"still":[85],"NP":[86],"complete":[87],"when":[88],"restricted":[89],"CNFs":[94],"which":[96],"({1":[102],"/":[103],"{n^\\beta":[104],"}})$.":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}