{"id":"https://openalex.org/W2077103259","doi":"https://doi.org/10.1137/0211026","title":"On the Accepting Density Hierarchy in NP","display_name":"On the Accepting Density Hierarchy in NP","publication_year":1982,"publication_date":"1982-05-01","ids":{"openalex":"https://openalex.org/W2077103259","doi":"https://doi.org/10.1137/0211026","mag":"2077103259"},"language":"en","primary_location":{"id":"doi:10.1137/0211026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211026","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/A5007961513","display_name":"Shlomo Moran","orcid":"https://orcid.org/0000-0003-3222-3308"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shlomo Moran","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007961513"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5353,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.66014938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":"2","first_page":"344","last_page":"349"},"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.998199999332428,"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.998199999332428,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9613000154495239,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9412999749183655,"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.8416730761528015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7415475249290466},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.6204617023468018},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6154343485832214},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.603385329246521},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5992646217346191},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5430921316146851},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5354905724525452},{"id":"https://openalex.org/keywords/natural-density","display_name":"Natural density","score":0.5275390148162842},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47847434878349304},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47603538632392883},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.4650363326072693},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45999372005462646},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.4562339782714844},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44859540462493896},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4110628664493561},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.40848782658576965},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.2461172640323639},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16496485471725464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11033952236175537}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8416730761528015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7415475249290466},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.6204617023468018},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6154343485832214},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.603385329246521},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5992646217346191},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5430921316146851},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5354905724525452},{"id":"https://openalex.org/C156491182","wikidata":"https://www.wikidata.org/wiki/Q752723","display_name":"Natural density","level":2,"score":0.5275390148162842},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47847434878349304},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47603538632392883},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.4650363326072693},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45999372005462646},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.4562339782714844},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44859540462493896},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4110628664493561},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.40848782658576965},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2461172640323639},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16496485471725464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11033952236175537},{"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/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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0211026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0211026","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1964053266","https://openalex.org/W1993138363","https://openalex.org/W1993749807","https://openalex.org/W2028776719","https://openalex.org/W2069919161","https://openalex.org/W2401610261","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1999609654","https://openalex.org/W1520700928","https://openalex.org/W1504200807","https://openalex.org/W4236887310","https://openalex.org/W2549774298","https://openalex.org/W2911798073","https://openalex.org/W2075449032","https://openalex.org/W2125536734","https://openalex.org/W4236121173","https://openalex.org/W2077103259"],"abstract_inverted_index":{"Let":[0],"$Al$":[1,21,40,57],"be":[2,127,146],"a":[3,9,23,59,69],"polynomial":[4,60],"time":[5,61],"nondeterministic":[6],"algorithm":[7,63],"accepting":[8,31,64,99,114,160],"set":[10,120],"A,":[11],"and":[12,33,139,190],"let":[13],"$a":[14,53],"\\in":[15,54],"A$.":[16],"The":[17],"\u201caccepting":[18,78],"density\u201d":[19,79],"of":[20,30,37,39,71,90,101,116,123,162,176,200,220],"for":[22,51,86,109,121,133,207],"is":[24,47,58,80,83,167,215],"the":[25,28,34,98,113,159,186,201,208,218],"ratio":[26,46],"between":[27,188],"number":[29,36],"computations":[32,38],"total":[35],"on":[41,97,185],"input":[42],"a.":[43],"(If":[44],"this":[45,67,110],"$":[48,132,166],"\\geqq":[49],"1/2$":[50],"all":[52],"A$,":[55],"then":[56],"probabilistic":[62],"A.)":[65],"In":[66],"paper":[68],"characterization":[70],"sets":[72,102,163,177],"in":[73,103,164,170,178],"NP":[74,91,104,118,141],"according":[75],"to":[76,148,196],"their":[77],"investigated.":[81],"It":[82,106],"shown":[84],"that":[85,108,140,143,158,175,195,198],"some":[87,134,171],"relativized":[88,111,189],"form":[89,112],"no":[92],"general,":[93],"nontrivial":[94],"lower":[95],"bound":[96],"density":[100,115,161],"exists.":[105],"follows":[107],"any":[117,199],"complete":[119],"inputs":[122],"length":[124],"n":[125],"cannot":[126],"greater":[128],"than":[129,174],"$1/2^{n^c":[130],"}":[131],"fixed":[135],"$c":[136],">":[137],"0$":[138],"(under":[142],"relativization)":[144],"can":[145],"partitioned":[147],"infinitely":[149],"many":[150],"classes":[151],"$C_1":[152],",C_2":[153],",":[154],"\\cdots":[155],"$,":[156],"such":[157],"$C_i":[165],"strictly":[168],"greater,":[169],"precise":[172],"sense,":[173],"$C_{i":[179],"+":[180],"1}":[181],"$.":[182],"Recent":[183],"works":[184],"relationship":[187],"unrelativized":[191],"proof":[192],"techniques":[193],"imply":[194],"prove":[197],"above":[202],"results":[203],"does":[204],"not":[205],"hold":[206],"(unrelativized)":[209],"class":[210],"NP,":[211],"possible":[212],"at":[213],"all,":[214],"probably":[216],"beyond":[217],"ability":[219],"today\u2019s":[221],"techniques.":[222]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}