{"id":"https://openalex.org/W2094321606","doi":"https://doi.org/10.1007/bf02125350","title":"Query complexity, or why is it difficult to separateNP A \u2229coNP A fromP A by random oraclesA?","display_name":"Query complexity, or why is it difficult to separateNP A \u2229coNP A fromP A by random oraclesA?","publication_year":1989,"publication_date":"1989-12-01","ids":{"openalex":"https://openalex.org/W2094321606","doi":"https://doi.org/10.1007/bf02125350","mag":"2094321606"},"language":"en","primary_location":{"id":"doi:10.1007/bf02125350","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02125350","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5031444562","display_name":"G\u00e1bor Tardos","orcid":"https://orcid.org/0000-0002-4281-1843"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"G. Tardos","raw_affiliation_strings":["Department of Algebra, E\u00f6tv\u00f6s University, M\u00fazeum krt. 6-8, H-1088, Budapest, Hungary","Department of Algebra, E\u00f6tv\u00f6s University, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"Department of Algebra, E\u00f6tv\u00f6s University, M\u00fazeum krt. 6-8, H-1088, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]},{"raw_affiliation_string":"Department of Algebra, E\u00f6tv\u00f6s University, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031444562"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":3.8098,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.94447624,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"4","first_page":"385","last_page":"392"},"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.9993000030517578,"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.9987000226974487,"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/oracle","display_name":"Oracle","score":0.8209890127182007},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8121764063835144},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6022189855575562},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5605719089508057},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5420578122138977},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.5407915115356445},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5237277150154114},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5159988403320312},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5017969608306885},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49387460947036743},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4800480604171753},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.47513559460639954},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45417922735214233},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.45313140749931335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.452343612909317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3635367751121521},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.342231422662735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2786563038825989},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.24075853824615479},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.17081332206726074}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8209890127182007},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8121764063835144},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6022189855575562},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5605719089508057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5420578122138977},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.5407915115356445},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5237277150154114},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5159988403320312},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5017969608306885},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49387460947036743},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4800480604171753},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.47513559460639954},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45417922735214233},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.45313140749931335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.452343612909317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3635367751121521},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.342231422662735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2786563038825989},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.24075853824615479},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.17081332206726074},{"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/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/bf02125350","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02125350","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"}],"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/W155622430","https://openalex.org/W1496913341","https://openalex.org/W1970755596","https://openalex.org/W1972416792","https://openalex.org/W1973386461","https://openalex.org/W1984976620","https://openalex.org/W1992972561","https://openalex.org/W1993138363","https://openalex.org/W2014850486","https://openalex.org/W2045664183","https://openalex.org/W2045924252","https://openalex.org/W2055421995","https://openalex.org/W2059312796","https://openalex.org/W2060972166","https://openalex.org/W2062767125","https://openalex.org/W2080575940","https://openalex.org/W2096390054","https://openalex.org/W2098225435","https://openalex.org/W2144752539","https://openalex.org/W2148957455"],"related_works":["https://openalex.org/W4236887310","https://openalex.org/W4236121173","https://openalex.org/W1520700928","https://openalex.org/W4388215614","https://openalex.org/W2051933114","https://openalex.org/W2075449032","https://openalex.org/W2134140745","https://openalex.org/W2169625092","https://openalex.org/W2951313060","https://openalex.org/W4300950794"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}