{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:19Z","timestamp":1742591419062,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540187400"},{"type":"electronic","value":"9783540481386"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18740-5_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:43:50Z","timestamp":1330199030000},"page":"185-196","source":"Crossref","is-referenced-by-count":3,"title":["Some observations about NP complete sets"],"prefix":"10.1007","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-08860-1_6","volume":"62","author":"P. Berman","year":"1978","unstructured":"P. Berman. Relationships between density and deterministic complexity of NP-complete languages. Proceedings of the 5th International Colloquium on Automata, Languages, and Programming, Springer-Verlag Lecture Notes in Computer Science, 62, pp. 63\u201371, 1978.","journal-title":"Proceedings of the 5th International Colloquium on Automata, Languages, and Programming"},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01768464","volume":"11","author":"R.V. Book","year":"1978","unstructured":"R.V. Book, et al, \u201dInclusion Complete Tally Languages and the Hartmanis-Berman Conjecture\u201d, Math. Systems Theory 11, pp. 1\u20138, 1978.","journal-title":"Math. Systems Theory"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"J. Balcazar, R. Book, T. Long, U. Schoening, and A. Selman. Sparse oracles and uniform complexity classes. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 308\u2013313, 1984.","DOI":"10.1109\/SFCS.1984.715929"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T. Baker","year":"1975","unstructured":"T. Baker, J. Gill, and R. Solovay. Relativizations of the P=? NP question. SIAM Journal on Computing 4, pp. 431\u2013442, 1975.","journal-title":"SIAM Journal on Computing"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM Journal on Computing 6, pp. 305\u2013322, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","volume":"26","author":"R.V. Book","year":"1974","unstructured":"R.V. Book. Tally Languages and Complexity classes. Information and Control 26, pp. 186\u2013193, 1974.","journal-title":"Information and Control"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"J. Cai and L. Hemachandra. The Boolean Hierarchy: hardware over NP. In Structure in Complexity Theory Springer-Verlag Lecture Notes in Computer Science #233, pp. 105\u2013124, 1986.","DOI":"10.1007\/3-540-16486-3_93"},{"key":"41_CR8","unstructured":"M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"J. Goldsmith and D. Joseph. Three results on the polynomial isomorphism of complete sets. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 390\u2013397, 1986.","DOI":"10.1109\/SFCS.1986.56"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 495\u2013503, 1984.","DOI":"10.1109\/SFCS.1984.715952"},{"key":"41_CR11","first-page":"55","volume":"16","author":"J. Hartmanis","year":"1983","unstructured":"J. Hartmanis. On Sparse Sets in NP-P: Information Processing Letters 16, pp. 55\u201360, 1983.","journal-title":"NP-P: Information Processing Letters"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computations. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 439\u2013445, 1983.","DOI":"10.1109\/SFCS.1983.21"},{"key":"41_CR13","unstructured":"J. Hartmanis. Solvable problems with conflicting relativizations. Bulletin of the European Association for Theoretical Computer Science, pp. 40\u201349, Oct. 1985."},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and L. Hemachandra. Complexity classes without machines: on complete languages for UP. In Automata, Languages, and Programming (ICALP 1986) Springer-Verlag Lecture Notes in Computer Science #226, pp. 123\u2013135, 1986.","DOI":"10.1007\/3-540-16761-7_62"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and L. Hemachandra. On Sparse Oracles Separating Feasible Complexity Classes. In STACS: 3rd Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag Lecture Notes in Computer Science #210, pp. 321\u2013333, 1986.","DOI":"10.1007\/3-540-16078-7_86"},{"key":"41_CR16","volume-title":"One-Way Functions, Robustness, and the Non-Isomorphism of NP Complete Sets. Department of Computer Science","author":"J. Hartmanis","year":"1987","unstructured":"J. Hartmanis and L. Hemachandra. One-Way Functions, Robustness, and the Non-Isomorphism of NP Complete Sets. Department of Computer Science, Cornell University, Ithaca, New York. Technical Report TR 86\u2013796. To be presented at Structure in Complexity Theory, 1987."},{"key":"41_CR17","doi-asserted-by":"crossref","unstructured":"J. Hartmanis and N. Immerman. On complete problems for NP \u2229 coNP. In Automata, Languages, and Programming (ICALP 1985), Springer-Verlag Lecture Notes in Computer Science #194, pp. 250\u2013259, 1985.","DOI":"10.1007\/BFb0015750"},{"key":"41_CR18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0019-9958(85)80004-8","volume":"65","author":"J. Hartmanis","year":"1985","unstructured":"J. Hartmanis, N. Immerman, and V. Sewelson. Sparse sets in NP-P: EXPTIME versus NEXPTIME. Information and Control, 65, pp. 159\u2013181, May\/June 1985.","journal-title":"Information and Control"},{"key":"41_CR19","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"41_CR20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","volume":"34","author":"J. Hartmanis","year":"1984","unstructured":"J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34, pp. 17\u201332, 1984.","journal-title":"Theoretical Computer Science"},{"key":"41_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","volume":"39","author":"D. Joseph","year":"1985","unstructured":"D. Joseph and P. Young. Some remarks on witness functions for non-polynomial and non-complete sets in NP. Theoretical Computer Science, 39, pp. 225\u2013237, 1985.","journal-title":"Theoretical Computer Science"},{"key":"41_CR22","unstructured":"J. Kadin. Deterministic Polynomial Time with O(log(n)) Queries. Technical Report TR-86-771, Cornell University, August 1986."},{"key":"41_CR23","unstructured":"J. Kadin. P NP[log] and sparse Turing complete sets for NP. 1986. Accepted for Structure in Complexity Theory, 1987."},{"key":"41_CR24","doi-asserted-by":"crossref","unstructured":"R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In ACM Symposium on Theory of Computing, pp. 302\u2013309, 1980.","DOI":"10.1145\/800141.804678"},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"S. Kurtz, S. Mahaney, and J. Royer. Collapsing degrees. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 380\u2013389, 1986.","DOI":"10.1109\/SFCS.1986.13"},{"key":"41_CR26","first-page":"1","volume":"1","author":"A. Kolmogorov","year":"1965","unstructured":"A. Kolmogorov. Three approaches for defining the concept of information quantity. Prob. Inform. Trans., 1, pp. 1\u20137, 1965.","journal-title":"Prob. Inform. Trans."},{"key":"41_CR27","doi-asserted-by":"crossref","unstructured":"D. Kozen. Indexing of Subrecursive classes. Theoretical Computer Science, pp. 277\u2013301, 1980.","DOI":"10.1016\/0304-3975(80)90017-1"},{"key":"41_CR28","unstructured":"S. Kurtz. A relativized failure of the Berman-Hartmanis conjecture. 1983. Unpublished manuscript."},{"key":"41_CR29","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1137\/0214008","volume":"14","author":"S. Kurtz","year":"1983","unstructured":"S. Kurtz. Sparse Sets in NP-P: Relativizations. SIAM Journal of Computing 14, pp. 113\u2013119, 1983.","journal-title":"SIAM Journal of Computing"},{"key":"41_CR30","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"R. Ladner. On the Structure of polynomial time reducibility. Journal of the Association for Computing Machinery 22, pp. 155\u2013171, 1975.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"41_CR31","volume-title":"Lower Bounds in Computational Complexity","author":"L. Ming","year":"1985","unstructured":"Ming Li. Lower Bounds in Computational Complexity, Ph.D. Thesis, Cornell University, Ithaca, New York, 1985."},{"key":"41_CR32","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0022-0000(82)90050-2","volume":"24","author":"T.J. Long","year":"1982","unstructured":"T.J. Long. A note on sparse oracles for NP. Journal of Computer and System Sciences, 24, pp. 224\u2013232, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"41_CR33","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1137\/0214043","volume":"14","author":"T.J. Long","year":"1985","unstructured":"T.J. Long. On restricting the size of oracles compared with restricting access to oracles. SIAM Journal on Computing, 14, pp. 585\u2013597, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"41_CR34","doi-asserted-by":"crossref","unstructured":"S. Mahaney. Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 54\u201360, 1980.","DOI":"10.1109\/SFCS.1980.40"},{"key":"41_CR35","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","author":"S. Mahaney","year":"1982","unstructured":"S. Mahaney. Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. Journal of Computer and Systems Sciences, 25, pp. 130\u2013143, 1982.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"41_CR36","doi-asserted-by":"crossref","unstructured":"S. Mahaney. On the number of p-isomorphism classes of NP-complete sets. Proceedings of the 22nd IEEE Symposium on Foundations of Computer Science, pp. 130\u2013143, 1981.","DOI":"10.1109\/SFCS.1981.30"},{"key":"41_CR37","first-page":"63","volume-title":"Studies in Complexity Theory","author":"S. Mahaney","year":"1986","unstructured":"S. Mahaney. Sparse sets and reducibilities. In Studies in Complexity Theory, ed. R.V. Book, John Wiley and sons, Inc., New York, pp. 63\u2013118, 1986."},{"key":"41_CR38","doi-asserted-by":"crossref","unstructured":"S. Mahaney and P. Young. Reductions among polynomial isomorphism types. Theoretical Computer Science, pp. 207\u2013224, 1985.","DOI":"10.1016\/0304-3975(85)90139-2"},{"key":"41_CR39","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/322290.322306","volume":"29","author":"C. Rackoff","year":"1982","unstructured":"C. Rackoff. Relativized questions involving probabilistic algorithms. Journal of ACM, 29, pp. 261\u2013268, 1982.","journal-title":"Journal of ACM"},{"key":"41_CR40","first-page":"368","volume":"#158","author":"K. Regan","year":"1983","unstructured":"K. Regan. On diagonalization methods and the structure of language classes. Proceedings FCT '83, Springer-Verlag Lecture Notes in Computer Science #158, pp. 368\u2013380, 1983.","journal-title":"Proceedings FCT '83"},{"key":"41_CR41","unstructured":"K. Regan. On the separation of complexity classes. Ph.D. dissertation, Oxford University, August 1986."},{"key":"41_CR42","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"H. Rogers, Jr. \u201dTheory of Recursive Functions and Effective Computability\u201d, McGraw-Hill, New York, NY, 1967."},{"key":"41_CR43","doi-asserted-by":"crossref","unstructured":"U. Schoening. Complexity and Structure. Springer-Verlag Lecture Notes in Computer Science #211, 1986.","DOI":"10.1007\/3-540-16079-5"},{"key":"41_CR44","doi-asserted-by":"crossref","unstructured":"M. Sipser. On relativization and the existence of complete sets. In Automata, Language, and Programming (ICALP 1982), Springer-Verlag Lecture Notes in Computer Science #140, pp. 523\u2013531, 1982.","DOI":"10.1007\/BFb0012797"},{"key":"41_CR45","doi-asserted-by":"crossref","unstructured":"A.L. Selman and J. Grollmann. Complexity measures for public-key cryptosystems. Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, pp. 495\u2013503, 1984.","DOI":"10.1109\/SFCS.1984.715952"},{"key":"41_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3, pp. 1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"41_CR47","doi-asserted-by":"crossref","unstructured":"A. Yao. Separating the Polynomial-time hierarchy by oracles. In Proceedings IEEE Symposium on Foundations of Computer Science, pp. 1\u201310, 1985.","DOI":"10.1109\/SFCS.1985.49"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18740-5_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:39:54Z","timestamp":1742589594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18740-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540187400","9783540481386"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/3-540-18740-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}