{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T08:45:04Z","timestamp":1787388304996,"version":"build-2736575974"},"reference-count":14,"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>We construct an oracle relative to which ${\\bf P} \\ne \\bf {NP}$ and there are no sparse sets in $\\bf {NP}$\u2013$\\bf {P}$. The well-known construction of Baker, Gill and Solovay [SIAM J. Comput., 4 (1975), pp. 431\u2013442] gives an oracle relative to which there is a sparse set in $\\bf {NP}$\u2013${\\bf P}$. Together, these results show that simple modifications of conventional proof techniques cannot establish whether or not sparse sets exist in $\\bf {NP}$\u2013$\\bf {P}$, even if one assumes ${\\bf P} \\ne \\bf {NP}$.<\/jats:p>","DOI":"10.1137\/0214008","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"113-119","source":"Crossref","is-referenced-by-count":17,"title":["Sparse Sets in : Relativizations"],"prefix":"10.1137","volume":"14","author":[{"given":"Stuart A.","family":"Kurtz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"RBCH","unstructured":"A. B. Borodin, R. L. Constable, J. E. Hopcroft,  Dense and nondense families of complexity classes,  IEEE 10th Annual Symp. on Switching and Automata Theory,  1969,  7\u201319"},{"key":"RBGS","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"RBH","doi-asserted-by":"publisher","DOI":"10.1137\/0206023"},{"key":"RBWX","doi-asserted-by":"publisher","DOI":"10.1137\/0211048"},{"key":"RCO","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.51.1.105"},{"key":"RCO","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.51.1.105"},{"key":"RFE","doi-asserted-by":"publisher","DOI":"10.4064\/fm-56-3-325-345"},{"key":"RHIS","unstructured":"S. Hartmanis, N. Immerman, V. Sewelson,  Sparse sets in  NP\u2212P: Exptime versus Nexptime,  Proc. 15th Annual ACM STOC,  1983,  382\u2013391"},{"key":"RHM","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90003-8"},{"key":"RHU","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft John E.","year":"1979"},{"key":"RJO","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629181.004"},{"key":"RLA","doi-asserted-by":"publisher","DOI":"10.1145\/321864.321877"},{"key":"RRO","volume-title":"Theory of recursive functions and effective computability","author":"Rogers H.","year":"1967"},{"key":"RWI","unstructured":"C. Wilson,  Relativization, reducibilities, and the exponential hierarchy, Technical Report, 140\/80, Department of Computer Science, Univ. Toronto,  1980"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:42:12Z","timestamp":1787337732000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,2]]}},"alternative-id":["10.1137\/0214008"],"URL":"https:\/\/doi.org\/10.1137\/0214008","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,2]]}}}