{"id":"https://openalex.org/W2021131202","doi":"https://doi.org/10.1137/0209003","title":"Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations","display_name":"Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations","publication_year":1980,"publication_date":"1980-02-01","ids":{"openalex":"https://openalex.org/W2021131202","doi":"https://doi.org/10.1137/0209003","mag":"2021131202"},"language":"en","primary_location":{"id":"doi:10.1137/0209003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209003","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/A5041320338","display_name":"Chandra M. R. Kintala","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chandra M. R. Kintala","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5022658667","display_name":"Patrick C. Fischer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patrick C. Fischer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041320338"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6369,"has_fulltext":false,"cited_by_count":82,"citation_normalized_percentile":{"value":0.83610289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"46","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/mathematics","display_name":"Mathematics","score":0.7231389880180359},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7044492959976196},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7020367383956909},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6372371912002563},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5313499569892883},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5212762355804443},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5088953971862793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4998745918273926},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4728444218635559},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42419883608818054},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41813552379608154},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4139400124549866},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.22710570693016052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.07516857981681824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.06375181674957275}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7231389880180359},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7044492959976196},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7020367383956909},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6372371912002563},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5313499569892883},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5212762355804443},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5088953971862793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4998745918273926},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4728444218635559},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42419883608818054},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41813552379608154},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4139400124549866},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.22710570693016052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.07516857981681824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.06375181674957275},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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.1137/0209003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209003","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":[{"id":"https://openalex.org/F4320307758","display_name":"Eli Lilly and Company","ror":"https://ror.org/01qat3289"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1993138363","https://openalex.org/W2045664183","https://openalex.org/W2125495920","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2059442203","https://openalex.org/W2122747219","https://openalex.org/W1629505938","https://openalex.org/W2000805093","https://openalex.org/W1523547988","https://openalex.org/W1676587966","https://openalex.org/W2144557478","https://openalex.org/W1483438220","https://openalex.org/W2415632638","https://openalex.org/W1722394934"],"abstract_inverted_index":{"Let":[0],"$\\mathcal":[1,39,120],"{P}_{g(n)}":[2,33,40],"$":[3,109,129],"denote":[4],"the":[5,46,56,74,89,104,112,126],"class":[6,115],"of":[7,23,45,94,125],"languages":[8],"acceptable":[9],"by":[10],"polynomial-time":[11],"bounded":[12],"Turing":[13],"machines":[14],"making":[15],"at":[16],"most":[17],"$g(n)$":[18,44],"nondeterministic":[19],"moves":[20],"on":[21],"inputs":[22],"length":[24],"n.":[25],"For":[26],"any":[27,100],"constructible":[28],"$g(n)$,$\\mathcal":[29],"{P}":[30],"\\subseteq":[31,34],"\\mathcal":[32,35],"{N}\\mathcal":[36],"{P}$The":[37],"classes":[38,61,76,90,105,130],"$,":[41],"for":[42,99],"various":[43],"form":[47],"$(\\log":[48,107,127],"n)^k":[49,108,128],",k":[50],"\\geqq":[51],"1$,":[52],"are":[53,62,68,133],"relativized":[54,60,75,119],"and":[55,83],"relationships":[57],"among":[58],"those":[59],"studied.":[63],"In":[64],"particular,":[65],"oracle":[66],"sets":[67],"constructed":[69],"which":[70],"(1)":[71],"make":[72,87,102],"all":[73,88,103],"equal":[77,117],"(this":[78],"follows":[79],"from":[80],"Baker,":[81],"Gill":[82],"Solovay":[84],"(1975));":[85],"(2)":[86],"associated":[91],"with":[92],"powers":[93],"$\\log":[95],"n$":[96],"different;":[97],"(3)":[98],"k,":[101],"below":[106],"different":[110],"while":[111],"kth":[113],"power":[114],"is":[116],"to":[118],"{NP}$.":[121],"Results":[122],"regarding":[123],"closure":[124],"under":[131],"complementation":[132],"also":[134],"given.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}