{"id":"https://openalex.org/W1493350325","doi":"https://doi.org/10.1007/3-540-45071-8_55","title":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","display_name":"Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1493350325","doi":"https://doi.org/10.1007/3-540-45071-8_55","mag":"1493350325"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45071-8_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45071-8_55","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5037092803","display_name":"Stefan Szeider","orcid":"https://orcid.org/0000-0001-8994-1656"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Stefan Szeider","raw_affiliation_strings":["Department of Computer Science, University of Toronto, M5S 3G4, Toronto, Ontario, Canada","Department of Computer Science University of Toronto  Toronto Ontario Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, M5S 3G4, Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science University of Toronto  Toronto Ontario Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037092803"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.9105,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92901619,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"548","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9986000061035156,"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.9975000023841858,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9028829336166382},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5965579748153687},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5299875140190125},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5223037600517273},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4807024598121643},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4656563401222229},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.45460033416748047},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4492071866989136},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44588130712509155},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42271688580513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39125874638557434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3599264323711395}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9028829336166382},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5965579748153687},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5299875140190125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5223037600517273},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4807024598121643},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4656563401222229},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.45460033416748047},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4492071866989136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44588130712509155},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42271688580513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39125874638557434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3599264323711395},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-45071-8_55","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45071-8_55","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W140130170","https://openalex.org/W1493350325","https://openalex.org/W1525293204","https://openalex.org/W1569272689","https://openalex.org/W1957114827","https://openalex.org/W1978107969","https://openalex.org/W2003979824","https://openalex.org/W2014111643","https://openalex.org/W2015211698","https://openalex.org/W2021183451","https://openalex.org/W2042705674","https://openalex.org/W2070658982","https://openalex.org/W2109716789","https://openalex.org/W2139442450","https://openalex.org/W2141191281","https://openalex.org/W2158505527","https://openalex.org/W2798588639","https://openalex.org/W2913688336","https://openalex.org/W4292230561","https://openalex.org/W6750258011"],"related_works":["https://openalex.org/W2997249752","https://openalex.org/W1865369187","https://openalex.org/W2523981875","https://openalex.org/W1767868015","https://openalex.org/W2171811389","https://openalex.org/W2041837101","https://openalex.org/W1598441350","https://openalex.org/W1539117866","https://openalex.org/W4287372456","https://openalex.org/W3123395501"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
