{"id":"https://openalex.org/W1999609654","doi":"https://doi.org/10.1137/0214003","title":"On Circuit-Size Complexity and the Low Hierarchy in NP","display_name":"On Circuit-Size Complexity and the Low Hierarchy in NP","publication_year":1985,"publication_date":"1985-02-01","ids":{"openalex":"https://openalex.org/W1999609654","doi":"https://doi.org/10.1137/0214003","mag":"1999609654"},"language":"en","primary_location":{"id":"doi:10.1137/0214003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214003","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/A5113600199","display_name":"Ker\u2010I Ko","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ker-I Ko","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5055009733","display_name":"Uwe Sch\u00f6ning","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Uwe Sch\u00f6ning","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113600199"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0094,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.97660146,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"1","first_page":"41","last_page":"51"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9991999864578247,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9970999956130981,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7976407408714294},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.7789384722709656},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.6998098492622375},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.6918622255325317},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6620231866836548},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6463239789009094},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.6405730247497559},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6036603450775146},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5827212929725647},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.5171605944633484},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.5160920023918152},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5123270750045776},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4791547656059265},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4732266664505005},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44392505288124084},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.2608080804347992},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2103036344051361},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.06604540348052979}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7976407408714294},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7789384722709656},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.6998098492622375},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.6918622255325317},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6620231866836548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6463239789009094},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.6405730247497559},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6036603450775146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5827212929725647},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.5171605944633484},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.5160920023918152},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5123270750045776},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4791547656059265},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4732266664505005},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44392505288124084},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.2608080804347992},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2103036344051361},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.06604540348052979},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214003","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":17,"referenced_works":["https://openalex.org/W1519919954","https://openalex.org/W1752550407","https://openalex.org/W1982717290","https://openalex.org/W1986203294","https://openalex.org/W1995893260","https://openalex.org/W2011042573","https://openalex.org/W2023336906","https://openalex.org/W2027466944","https://openalex.org/W2035558335","https://openalex.org/W2040387487","https://openalex.org/W2041317738","https://openalex.org/W2044504659","https://openalex.org/W2065251436","https://openalex.org/W2069139349","https://openalex.org/W2069890413","https://openalex.org/W2069919161","https://openalex.org/W2090186532"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W2911798073","https://openalex.org/W1999609654","https://openalex.org/W2798907744","https://openalex.org/W2951313060","https://openalex.org/W4300950794","https://openalex.org/W1520700928","https://openalex.org/W1556737090","https://openalex.org/W2053392269","https://openalex.org/W4236121173"],"abstract_inverted_index":{"Let":[0],"A":[1,10,31],"be":[2,15],"a":[3,66,89,96],"set":[4],"having":[5],"polynomial":[6,27,49,104,112],"size":[7,28,50],"circuits.":[8],"If":[9],"is":[11,32],"also":[12],"known":[13],"to":[14,72,116],"in":[16,34,45,53,63,80,83,88,108],"NP,":[17],"then":[18],"we":[19,41,69],"may":[20],"conclude":[21],"that":[22,43,74],"the":[23,26,56,60,111],"graph":[24],"of":[25,59,92],"circuits":[29],"for":[30],"actually":[33],"$\\Pi":[35],"_2^p":[36,118],"$.":[37,94,119],"Using":[38],"this":[39],"observation,":[40],"show":[42,73],"sets":[44,79,99],"NP":[46,81,109],"which":[47],"have":[48],"ciruits":[51],"are":[52,70,82,100],"$L_3^p":[54],"$,":[55,85],"third":[57],"level":[58],"low":[61,78],"hierarchy":[62,114],"NP.":[64],"By":[65],"similar":[67],"technique,":[68],"able":[71],"some":[75],"other":[76],"intuitively":[77],"$L_2^p":[84,93],"and":[86],"even":[87],"certain":[90],"refinement":[91],"As":[95],"consequence,":[97],"sparse":[98],"not":[101],"strong":[102],"nondeterministic":[103],"time":[105,113],"Turing":[106],"complete":[107],"unless":[110],"collapses":[115],"$\\Delta":[117]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}