{"id":"https://openalex.org/W2063158069","doi":"https://doi.org/10.1016/0304-3975(91)90160-4","title":"Bounded queries to SAT and the Boolean hierarchy","display_name":"Bounded queries to SAT and the Boolean hierarchy","publication_year":1991,"publication_date":"1991-07-01","ids":{"openalex":"https://openalex.org/W2063158069","doi":"https://doi.org/10.1016/0304-3975(91)90160-4","mag":"2063158069"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(91)90160-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90160-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5078715930","display_name":"Richard Beigel","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Richard Beigel","raw_affiliation_strings":["Department of Computer Science, The Johns Hopkins University, Baltimore, MD 21218, USA","Johns Hopkins University, baltimore, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The Johns Hopkins University, Baltimore, MD 21218, USA","institution_ids":["https://openalex.org/I145311948"]},{"raw_affiliation_string":"Johns Hopkins University, baltimore, MD","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078715930"],"corresponding_institution_ids":["https://openalex.org/I145311948"],"apc_list":{"value":2600,"currency":"USD","value_usd":2600},"apc_paid":null,"fwci":9.3945,"has_fulltext":false,"cited_by_count":114,"citation_normalized_percentile":{"value":0.98797939,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"84","issue":"2","first_page":"199","last_page":"223"},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9987999796867371,"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/bounded-function","display_name":"Bounded function","score":0.6887283325195312},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6874827146530151},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.680856466293335},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.650964081287384},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6347936391830444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5327451229095459},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5323743224143982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5306445956230164},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5215528011322021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5142795443534851},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47489824891090393},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.41120830178260803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4104048013687134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14241954684257507}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6887283325195312},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6874827146530151},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.680856466293335},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.650964081287384},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6347936391830444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5327451229095459},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5323743224143982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5306445956230164},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5215528011322021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5142795443534851},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47489824891090393},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.41120830178260803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4104048013687134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14241954684257507},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"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":2,"locations":[{"id":"doi:10.1016/0304-3975(91)90160-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(91)90160-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.9858","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.9858","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.uic.edu/~beigel/papers/queries-SAT-tcs.PS.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W48693379","https://openalex.org/W57269202","https://openalex.org/W73733072","https://openalex.org/W189098498","https://openalex.org/W1752076080","https://openalex.org/W1886600493","https://openalex.org/W1969386550","https://openalex.org/W1975790950","https://openalex.org/W1990851447","https://openalex.org/W1995304514","https://openalex.org/W2006337101","https://openalex.org/W2015568355","https://openalex.org/W2040234790","https://openalex.org/W2041943346","https://openalex.org/W2058277150","https://openalex.org/W2072181151","https://openalex.org/W2087237939","https://openalex.org/W2093454413","https://openalex.org/W2119024968","https://openalex.org/W2140152225","https://openalex.org/W2140778396","https://openalex.org/W2168714844","https://openalex.org/W2262467376","https://openalex.org/W2395091839","https://openalex.org/W2506855370","https://openalex.org/W4243643814","https://openalex.org/W6602070116","https://openalex.org/W6602968435","https://openalex.org/W6607751785","https://openalex.org/W6611399372","https://openalex.org/W6637911144","https://openalex.org/W6642561173","https://openalex.org/W6659136360","https://openalex.org/W6665431899","https://openalex.org/W6680606441","https://openalex.org/W6684637589","https://openalex.org/W6693146882","https://openalex.org/W7025394483"],"related_works":["https://openalex.org/W3215479332","https://openalex.org/W278676640","https://openalex.org/W2584059692","https://openalex.org/W2122747219","https://openalex.org/W266537895","https://openalex.org/W2574530711","https://openalex.org/W2020831804","https://openalex.org/W1589381382","https://openalex.org/W2549774298","https://openalex.org/W2002385864"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}