{"id":"https://openalex.org/W1868426342","doi":"https://doi.org/10.1007/978-3-319-06686-8_27","title":"The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits","display_name":"The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1868426342","doi":"https://doi.org/10.1007/978-3-319-06686-8_27","mag":"1868426342"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-06686-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-06686-8_27","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/A5046652726","display_name":"Konrad W. Schwerdtfeger","orcid":null},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Konrad Schwerdtfeger","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Hannover, Germany","Leibniz Universit\u00e4t\u00a0Hannover"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Leibniz Universit\u00e4t Hannover, Hannover, Germany","institution_ids":["https://openalex.org/I114112103"]},{"raw_affiliation_string":"Leibniz Universit\u00e4t\u00a0Hannover","institution_ids":["https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046652726"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8008,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73198153,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"351","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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.994700014591217,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9934999942779541,"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/trichotomy","display_name":"Trichotomy (philosophy)","score":0.8770221471786499},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6427432298660278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6335532665252686},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.614162802696228},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5965276956558228},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5570815801620483},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5526818633079529},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5377768278121948},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5196641683578491},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4320397675037384},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41987141966819763},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33885693550109863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2581159174442291}],"concepts":[{"id":"https://openalex.org/C2780233049","wikidata":"https://www.wikidata.org/wiki/Q13134154","display_name":"Trichotomy (philosophy)","level":2,"score":0.8770221471786499},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6427432298660278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6335532665252686},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.614162802696228},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5965276956558228},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5570815801620483},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5526818633079529},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5377768278121948},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5196641683578491},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4320397675037384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41987141966819763},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33885693550109863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2581159174442291},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-06686-8_27","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-06686-8_27","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W1490189322","https://openalex.org/W1542990689","https://openalex.org/W1589711670","https://openalex.org/W1741233485","https://openalex.org/W1859310323","https://openalex.org/W1976090101","https://openalex.org/W1989659704","https://openalex.org/W1997048861","https://openalex.org/W2023364974","https://openalex.org/W2063428816","https://openalex.org/W2082723133","https://openalex.org/W2101347856","https://openalex.org/W2132220327","https://openalex.org/W2166566648","https://openalex.org/W2621271919","https://openalex.org/W2962833328","https://openalex.org/W3125407811","https://openalex.org/W4251860244"],"related_works":["https://openalex.org/W35365073","https://openalex.org/W2148332793","https://openalex.org/W1745650241","https://openalex.org/W1946973508","https://openalex.org/W2184010066","https://openalex.org/W4249396218","https://openalex.org/W1568384982","https://openalex.org/W1656143853","https://openalex.org/W2945679648","https://openalex.org/W2067750021"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}