{"id":"https://openalex.org/W2169625092","doi":"https://doi.org/10.1137/s0097539798334736","title":"Separating Complexity Classes Using Autoreducibility","display_name":"Separating Complexity Classes Using Autoreducibility","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2169625092","doi":"https://doi.org/10.1137/s0097539798334736","mag":"2169625092"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539798334736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798334736","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/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lance Fortnow","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111961315","display_name":"Dieter van Melkebeek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dieter van Melkebeek","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004254084","display_name":"Leen Torenvliet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leen Torenvliet","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083983355"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2791,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.92437223,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"29","issue":"5","first_page":"1497","last_page":"1520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.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/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.8454012870788574},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7911286950111389},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7428197860717773},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.73847496509552},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6421160697937012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6219937205314636},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.5846380591392517},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5488333702087402},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5303633213043213},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5153750777244568},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5120013356208801},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5089192390441895},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5042616128921509},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.4803368151187897},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4585947096347809},{"id":"https://openalex.org/keywords/non-deterministic-turing-machine","display_name":"Non-deterministic Turing machine","score":0.441506028175354},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.43014034628868103},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42628800868988037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4254138469696045},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4135921001434326},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3907332718372345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2976836562156677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18160796165466309},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.1795051395893097}],"concepts":[{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.8454012870788574},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7911286950111389},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7428197860717773},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.73847496509552},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6421160697937012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6219937205314636},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.5846380591392517},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5488333702087402},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5303633213043213},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5153750777244568},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5120013356208801},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5089192390441895},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5042616128921509},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.4803368151187897},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4585947096347809},{"id":"https://openalex.org/C15190523","wikidata":"https://www.wikidata.org/wiki/Q1190223","display_name":"Non-deterministic Turing machine","level":5,"score":0.441506028175354},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.43014034628868103},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42628800868988037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4254138469696045},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4135921001434326},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3907332718372345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2976836562156677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18160796165466309},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.1795051395893097},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/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},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539798334736","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539798334736","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"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/12db9936-3577-4e66-b23d-c7b8b5c86501","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/separating-complexity-classes-using-autoreducibility(12db9936-3577-4e66-b23d-c7b8b5c86501).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H M, Fortnow, L, van Melkebeek, D & Torenvliet, L 2000, 'Separating complexity classes using autoreducibility', SIAM Journal on Computing, vol. 29, no. 5, pp. 1497-1520. https://doi.org/10.1137/S0097539798334736","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dare.uva.nl:publications/12db9936-3577-4e66-b23d-c7b8b5c86501","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/separating-complexity-classes-using-autoreducibility(12db9936-3577-4e66-b23d-c7b8b5c86501).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H M, Fortnow, L, van Melkebeek, D & Torenvliet, L 2000, 'Separating complexity classes using autoreducibility', SIAM Journal on Computing, vol. 29, no. 5, pp. 1497-1520. https://doi.org/10.1137/S0097539798334736","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/12db9936-3577-4e66-b23d-c7b8b5c86501","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/separating-complexity-classes-using-autoreducibility(12db9936-3577-4e66-b23d-c7b8b5c86501).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 29(5), 1497 - 1520. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W623765668","https://openalex.org/W1484001631","https://openalex.org/W1490686376","https://openalex.org/W1596720500","https://openalex.org/W1971070826","https://openalex.org/W1975715978","https://openalex.org/W2045033949","https://openalex.org/W2050457719","https://openalex.org/W2056414301","https://openalex.org/W2057512592","https://openalex.org/W2062965695","https://openalex.org/W2125495920","https://openalex.org/W2134202663","https://openalex.org/W2148352980","https://openalex.org/W2402054513","https://openalex.org/W2912080987","https://openalex.org/W4237363759"],"related_works":["https://openalex.org/W3205703342","https://openalex.org/W1504200807","https://openalex.org/W1999609654","https://openalex.org/W1520700928","https://openalex.org/W2911798073","https://openalex.org/W4236121173","https://openalex.org/W2020831804","https://openalex.org/W2951313060","https://openalex.org/W4300950794","https://openalex.org/W2169625092"],"abstract_inverted_index":{"A":[0],"set":[1,58],"is":[2,64],"autoreducible":[3,51],"if":[4,109],"it":[5],"can":[6],"be":[7],"reduced":[8],"to":[9,22,28,71,93,116,182],"itself":[10],"by":[11,36,82],"a":[12],"Turing":[13,40,56,119],"machine":[14],"that":[15,38,63],"does":[16],"not":[17],"ask":[18],"its":[19],"own":[20],"input":[21],"the":[23,30,47,105,113,147,157],"oracle.":[24],"We":[25,96,153,170],"use":[26],"autoreducibility":[27,158,177],"separate":[29,72,79,130],"polynomial-time":[31,148],"hierarchy":[32,49,149],"from":[33,134,141,150],"exponential":[34,61,124,151],"space":[35,62,140],"showing":[37,83],"all":[39,118],"complete":[41,57,120,160],"sets":[42,121,161],"for":[43,59,122],"certain":[44],"levels":[45],"of":[46,159,175],"exponential-time":[48],"are":[50,126],"but":[52],"there":[53],"exists":[54],"some":[55,174],"doubly":[60,123],"not.":[65],"Although":[66],"we":[67,110,128],"already":[68],"knew":[69],"how":[70,172],"these":[73,176],"classes":[74,80],"using":[75],"diagonalization,":[76],"our":[77],"proofs":[78],"solely":[81],"they":[84],"have":[85],"different":[86],"structural":[87],"properties,":[88],"thus":[89],"applying":[90],"Post's":[91],"program":[92],"complexity":[94,184],"theory.":[95],"feel":[97],"such":[98],"techniques":[99],"may":[100],"prove":[101],"unknown":[102],"separations":[103],"in":[104],"future.":[106],"In":[107],"particular,":[108],"could":[111],"settle":[112],"question":[114],"as":[115],"whether":[117],"time":[125,133],"autoreducible,":[127],"would":[129],"either":[131],"polynomial":[132,135,143],"space,":[136],"and":[137,167],"nondeterministic":[138,142],"logarithmic":[139],"time,":[144],"or":[145],"else":[146],"time.":[152],"also":[154,180],"look":[155],"at":[156],"under":[162],"nonadaptive,":[163],"bounded":[164],"query,":[165],"probabilistic,":[166],"nonuniform":[168],"reductions.":[169],"show":[171],"settling":[173],"questions":[178],"will":[179],"lead":[181],"new":[183],"class":[185],"separations.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}