{"id":"https://openalex.org/W3158535383","doi":"https://doi.org/10.1007/s00037-011-0033-1","title":"Satisfiability, Branch-Width and Tseitin tautologies","display_name":"Satisfiability, Branch-Width and Tseitin tautologies","publication_year":2011,"publication_date":"2011-11-24","ids":{"openalex":"https://openalex.org/W3158535383","doi":"https://doi.org/10.1007/s00037-011-0033-1","mag":"3158535383"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-011-0033-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-011-0033-1","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5108192310","display_name":"Michael Alekhnovich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Alekhnovich","raw_affiliation_strings":["Laboratory for Computer Science, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Laboratory for Computer Science, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["RU","US"],"is_corresponding":true,"raw_author_name":"Alexander Razborov","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, 08540, USA","Steklov Mathematical Institute, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, 08540, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"Steklov Mathematical Institute, Moscow, Russia","institution_ids":["https://openalex.org/I2801160905"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008113826"],"corresponding_institution_ids":["https://openalex.org/I2801160905","https://openalex.org/I40036882"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.9516,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.86958445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"4","first_page":"649","last_page":"678"},"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.9965999722480774,"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.9965999722480774,"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.996399998664856,"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/T11567","display_name":"semigroups and automata theory","score":0.9958999752998352,"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/mathematics","display_name":"Mathematics","score":0.710233747959137},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6951436400413513},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6912303566932678},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5901674032211304},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5526717305183411},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.5184609293937683},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47268015146255493},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44908636808395386},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4253951907157898},{"id":"https://openalex.org/keywords/tautology","display_name":"Tautology (logic)","score":0.42304643988609314},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42037534713745117},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.41130876541137695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15535056591033936},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07573923468589783}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.710233747959137},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6951436400413513},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6912303566932678},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5901674032211304},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5526717305183411},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.5184609293937683},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47268015146255493},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44908636808395386},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4253951907157898},{"id":"https://openalex.org/C166374712","wikidata":"https://www.wikidata.org/wiki/Q209555","display_name":"Tautology (logic)","level":5,"score":0.42304643988609314},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42037534713745117},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.41130876541137695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15535056591033936},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07573923468589783},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-011-0033-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-011-0033-1","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W56285243","https://openalex.org/W1518031539","https://openalex.org/W1982180670","https://openalex.org/W1999067488","https://openalex.org/W1999069928","https://openalex.org/W2005079828","https://openalex.org/W2012476164","https://openalex.org/W2016341899","https://openalex.org/W2038643780","https://openalex.org/W2047871605","https://openalex.org/W2049645218","https://openalex.org/W2074210283","https://openalex.org/W2084384424","https://openalex.org/W2097113315","https://openalex.org/W2109716789","https://openalex.org/W2122055721","https://openalex.org/W2136687801","https://openalex.org/W2152390092","https://openalex.org/W2166026605","https://openalex.org/W2950374629","https://openalex.org/W2986773320","https://openalex.org/W6764173381"],"related_works":["https://openalex.org/W1970590090","https://openalex.org/W3176904788","https://openalex.org/W4240374464","https://openalex.org/W2005573219","https://openalex.org/W1985572324","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}