{"id":"https://openalex.org/W2000171675","doi":"https://doi.org/10.1137/0222015","title":"One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete","display_name":"One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2000171675","doi":"https://doi.org/10.1137/0222015","mag":"2000171675"},"language":"en","primary_location":{"id":"doi:10.1137/0222015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222015","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/A5066646775","display_name":"Jan Kratochv\u0131\u0301l","orcid":"https://orcid.org/0000-0002-2620-6133"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Kratochv\u00edl","raw_affiliation_strings":["Charles University,"],"affiliations":[{"raw_affiliation_string":"Charles University,","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060114081","display_name":"Petr Savick\u00fd","orcid":"https://orcid.org/0000-0001-6974-0718"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Savick\u00fd","raw_affiliation_strings":["Charles University,"],"affiliations":[{"raw_affiliation_string":"Charles University,","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107094827","display_name":"Zsolt Tuza","orcid":null},"institutions":[{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Zsolt Tuza","raw_affiliation_strings":["Hungarian Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Hungarian Academy of Sciences","institution_ids":["https://openalex.org/I7597260"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066646775"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":1.5637,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.81436924,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"1","first_page":"203","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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/combinatorics","display_name":"Combinatorics","score":0.801429271697998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7990753650665283},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.700820803642273},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5663247108459473},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5260924100875854},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5003421306610107},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.4199659526348114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05504360795021057}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.801429271697998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7990753650665283},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.700820803642273},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5663247108459473},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5260924100875854},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5003421306610107},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.4199659526348114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05504360795021057},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0222015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222015","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:eprints.sztaki.hu:373","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/373/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2003979824","https://openalex.org/W2022392080","https://openalex.org/W2040924621","https://openalex.org/W2051336598","https://openalex.org/W2066022804","https://openalex.org/W2128452148"],"related_works":["https://openalex.org/W2480084299","https://openalex.org/W2014111643","https://openalex.org/W3107131366","https://openalex.org/W2091617677","https://openalex.org/W2571882453","https://openalex.org/W2076399409","https://openalex.org/W4211028879","https://openalex.org/W3128448798","https://openalex.org/W2408080066","https://openalex.org/W1608133301"],"abstract_inverted_index":{"A":[0],"Boolean":[1],"formula":[2,13],"in":[3,25],"a":[4,10],"conjunctive":[5],"normal":[6],"form":[7],"is":[8,33,41,50,57,66,69],"called":[9],"$(k,s)$":[11],"\u2013":[12],"if":[14],"every":[15,22,45,64],"clause":[16],"contains":[17],"exactly":[18],"k":[19],"variables":[20],"and":[21,68],"variable":[23],"occurs":[24],"at":[26],"most":[27],"s":[28],"clauses.":[29],"The":[30],"$(k,s)$\u2013${\\text{SAT}}$":[31,56],"problem":[32,36],"the":[34],"SATISFIABILITY":[35],"restricted":[37],"to":[38],"$(k,s)$\u2013formulas.":[39],"It":[40],"proved":[42],"that":[43,55],"for":[44,59,71,102],"$k":[46,103],"\\geqslant":[47,73,104],"3$":[48],"there":[49],"an":[51],"integer":[52],"$f(k)$":[53,78],"such":[54],"trivial":[58],"$s":[60,72],"\\leqslant":[61,90,92],"f(k)$":[62],"(because":[63],"$(k,s)$\u2013formula":[65],"satisfiable)":[67],"NP-complete":[70],"f(k)":[74,91],"+":[75],"1$.":[76],"Moreover,":[77],"grows":[79],"exponentially":[80],"with":[81],"k,":[82],"namely,":[83],"$\\lfloor":[84],"{{{2^k":[85],"}":[86],"/":[87],"{ek}}}":[88],"\\rfloor":[89],"2^{k":[93,97],"-":[94,96,98,100],"1}":[95],"4}":[99],"1$":[101],"4$.":[105]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}