{"id":"https://openalex.org/W2167906337","doi":"https://doi.org/10.1137/s0097539799362639","title":"The Minimization Problem for Boolean Formulas","display_name":"The Minimization Problem for Boolean Formulas","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2167906337","doi":"https://doi.org/10.1137/s0097539799362639","mag":"2167906337"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799362639","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799362639","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/A5071803397","display_name":"Edith Hemaspaandra","orcid":"https://orcid.org/0000-0002-7115-626X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Edith Hemaspaandra","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002697551","display_name":"Gerd Wechsung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerd Wechsung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071803397"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0163,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.77334707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"6","first_page":"1948","last_page":"1958"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9995999932289124,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5625475645065308},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5560648441314697},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4996325969696045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47155094146728516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4570688009262085},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4566068649291992},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45219266414642334},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.44919562339782715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4228288233280182},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3869713544845581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22928959131240845}],"concepts":[{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5625475645065308},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5560648441314697},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4996325969696045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47155094146728516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4570688009262085},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4566068649291992},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45219266414642334},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.44919562339782715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4228288233280182},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3869713544845581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22928959131240845},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539799362639","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799362639","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1972326543","https://openalex.org/W1973023438","https://openalex.org/W1990216234","https://openalex.org/W1997240046","https://openalex.org/W2058277150","https://openalex.org/W2065251436","https://openalex.org/W2066051963","https://openalex.org/W2069652878","https://openalex.org/W2072181151","https://openalex.org/W2088044688","https://openalex.org/W2093454413","https://openalex.org/W2093712769"],"related_works":["https://openalex.org/W2982557863","https://openalex.org/W2623377418","https://openalex.org/W1568918982","https://openalex.org/W2796388654","https://openalex.org/W2171811389","https://openalex.org/W1589381382","https://openalex.org/W195515244","https://openalex.org/W2127594621","https://openalex.org/W1530996181","https://openalex.org/W2399929470"],"abstract_inverted_index":{"More":[0],"than":[1],"a":[2,5,16],"quarter":[3],"of":[4,10,13,38],"century":[6],"ago,":[7],"the":[8,11,28,34],"question":[9],"complexity":[12],"determining":[14],"whether":[15],"given":[17],"Boolean":[18],"formula":[19],"is":[20,77],"minimal":[21],"motivated":[22],"Meyer":[23],"and":[24,40,50,53,71],"Stockmeyer":[25],"to":[26,47,61,83],"define":[27],"polynomial":[29],"hierarchy.":[30],"This":[31],"problem":[32,74],"(in":[33],"standard":[35],"formalized":[36],"version---that":[37],"Garey":[39],"Johnson)":[41],"has":[42],"been":[43,59],"known":[44],"for":[45,80],"decades":[46],"be":[48],"coNP-hard":[49],"in":[51,75],"NPNP,":[52],"yet":[54],"no":[55],"one":[56],"had":[57],"even":[58],"able":[60],"establish":[62],"(many-one)":[63,78],"NP-hardness.":[64],"In":[65],"this":[66],"paper,":[67],"we":[68],"show":[69],"that":[70],"more:":[72],"The":[73],"fact":[76],"hard":[79],"parallel":[81],"access":[82],"NP.":[84]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}