{"id":"https://openalex.org/W2167277189","doi":"https://doi.org/10.1137/0221045","title":"On the Structure of Bounded Queries to Arbitrary NP Sets","display_name":"On the Structure of Bounded Queries to Arbitrary NP Sets","publication_year":1992,"publication_date":"1992-08-01","ids":{"openalex":"https://openalex.org/W2167277189","doi":"https://doi.org/10.1137/0221045","mag":"2167277189"},"language":"en","primary_location":{"id":"doi:10.1137/0221045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221045","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/A5082398104","display_name":"Richard Chang","orcid":"https://orcid.org/0000-0001-5278-7958"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard Chang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082398104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4644,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.66562344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":"4","first_page":"743","last_page":"754"},"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.9998999834060669,"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.9998999834060669,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/combinatorics","display_name":"Combinatorics","score":0.7953392863273621},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6093193888664246},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5962120294570923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5324702262878418},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.4842474162578583},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.440351277589798},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40156909823417664}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7953392863273621},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6093193888664246},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5962120294570923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5324702262878418},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.4842474162578583},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.440351277589798},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40156909823417664},{"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/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0221045","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0221045","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/W1511894390","https://openalex.org/W1991109776","https://openalex.org/W1999609654","https://openalex.org/W2011042573","https://openalex.org/W2052936500","https://openalex.org/W2053094807","https://openalex.org/W2063158069","https://openalex.org/W2082636129","https://openalex.org/W2090039116","https://openalex.org/W2136500328","https://openalex.org/W2153191867","https://openalex.org/W2167105569"],"related_works":["https://openalex.org/W4388962799","https://openalex.org/W2041517264","https://openalex.org/W1522180487","https://openalex.org/W4294789866","https://openalex.org/W1969386550","https://openalex.org/W2982557863","https://openalex.org/W2590361123","https://openalex.org/W1575303034","https://openalex.org/W2057722348","https://openalex.org/W4230341406"],"abstract_inverted_index":{"Kadin":[0],"[SIAM":[1],"J.":[2],"Comput.,":[3],"17":[4],"(1988),":[5],"pp.":[6],"1263\u20131282]":[7],"showed":[8],"that":[9,36,114],"if":[10,60,108],"the":[11,75],"polynomial":[12],"hierarchy":[13,40],"(PH)":[14],"has":[15,62],"infinitely":[16,63],"many":[17,64],"levels,":[18,65],"then":[19,66,119],"for":[20,52,74],"all":[21],"k,":[22],"${\\text{P}}^{{\\operatorname{SAT}}[k]}":[23],"\\subset":[24,68],"{\\text{P}}^{{\\operatorname{SAT}}[K":[25],"+":[26,70,81],"1]}":[27,71,82],"$.":[28,72,125],"This":[29],"paper":[30],"extends":[31],"Kadin\u2019s":[32],"technique":[33],"and":[34],"shows":[35],"a":[37],"proper":[38],"query":[39,104],"is":[41,84],"not":[42,85],"an":[43],"exclusive":[44],"property":[45],"of":[46,77],"NP":[47],"complete":[48],"sets.":[49],"In":[50],"fact,":[51],"any":[53,111],"$A":[54],"\\in":[55],"{\\text{NP}}":[56],"-":[57],"\\widehat{{\\text{low}}}_{3}":[58],"$,":[59,118],"PH":[61,120],"${\\text{P}}^{A[k]}":[67],"{\\text{P}}^{A[K":[69],"Moreover,":[73],"case":[76],"parallel":[78],"queries,":[79],"${\\text{P}}^{A||[k":[80],"$":[83,90],"even":[86],"contained":[87],"in":[88],"${\\text{P}}^{{\\operatorname{SAT}}||[K]}":[89],",":[91],"These":[92],"same":[93],"techniques":[94],"can":[95],"be":[96],"used":[97],"to":[98,122],"explore":[99],"some":[100],"other":[101],"questions":[102],"about":[103],"hierarchies.":[105],"For":[106],"example,":[107],"there":[109],"exists":[110],"A":[112],"such":[113],"${\\text{P}}^{A[2]}":[115],"=":[116],"{\\text{P}}^{{\\operatorname{SAT}}[1]}":[117],"collapses":[121],"$\\Delta":[123],"_3^P":[124]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}