{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:30:34Z","timestamp":1787340634025,"version":"build-2736575974"},"reference-count":11,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,2]]},"abstract":"<jats:p>Relativizations of complexity classes in which simple sets exist are considered. A recursive oracle is constructed relative to which a simple set exists for NP. Some other general theorems are proven, showing that the time bounds are not a crucial hypothesis; bounds on the way in which the oracle is accessible, namely, the number of queries and\/or the number of nondeterministic steps, are shown to be the fundamental hypothesis. As a result, simple sets are shown to exist in many different relativized complexity classes.<\/jats:p>","DOI":"10.1137\/0214012","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"148-157","source":"Crossref","is-referenced-by-count":22,"title":["Simplicity, Relativizations and Nondeterminism"],"prefix":"10.1137","volume":"14","author":[{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90061-X"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0211048"},{"key":"R4","unstructured":"W. Gasarch, S. Homer,  Relativizations of the exponential time hierarchy,  1982, unpublished manuscript"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90003-8"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"C. M. R. Kintala, Masters Thesis,  Computations with a restricted number of nondeterministic steps, Ph.D. dissertation, Pennsylvania State University,  1977","DOI":"10.1145\/800105.803407"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0209003"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/321892.321895"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0213023"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0212037"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322399"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:17Z","timestamp":1787337737000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214012"],"URL":"https:\/\/doi.org\/10.1137\/0214012","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}