{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T21:11:20Z","timestamp":1772745080262,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11247,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0022-0000(82)90002-2","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"130-143","source":"Crossref","is-referenced-by-count":230,"title":["Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis"],"prefix":"10.1016","volume":"25","author":[{"given":"Stephen R.","family":"Mahaney","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(82)90002-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(82)90002-2_BIB2_1","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90002-2_BIB2_2","series-title":"Proceedings Eighth Annual ACM Symposium on Theory of Computing","first-page":"30","author":"Berman","year":"1976"},{"key":"10.1016\/0022-0000(82)90002-2_BIB3","series-title":"Fifth International Colloquium on Automata, Languages, and Programming","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","volume":"Vol. 62","author":"Berman","year":"1978"},{"key":"10.1016\/0022-0000(82)90002-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01768464","article-title":"Inclusion complete tally languages and the Hartmanis-Berman conjecture","volume":"11 (","author":"Book","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(82)90002-2_BIB5","series-title":"Proceedings, 3rd Annual ACM Symposium on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(82)90002-2_BIB6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0208034","article-title":"A note on sparse complete sets","volume":"8","author":"Fortune","year":"1979","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0022-0000(82)90002-2_BIB7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(82)90002-2_BIB8","article-title":"On Census Complexity and Sparseness of NP-Complete Sets","author":"Hartmanis","year":"1980","journal-title":"Cornell University, Computer Science Department Technical Report TR 80-416, Ithaca. New York"},{"key":"10.1016\/0022-0000(82)90002-2_BIB9_1","series-title":"Proceedings of Mathematical Foundations of Computer Science, 9th Symposium","article-title":"An essay about research on sparse NP-complete sets","volume":"Vol. 88","author":"Hartmanis","year":"1980"},{"key":"10.1016\/0022-0000(82)90002-2_BIB9_2","author":"Hartmanis","year":"1980","journal-title":"Cornell University, Department of Computer Science Technical Report TR 80-244"},{"key":"10.1016\/0022-0000(82)90002-2_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(82)90002-2_BIB11","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(82)90002-2_BIB12","series-title":"Proceedings, 12th ACM Symposium on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0022-0000(82)90002-2_BIB13","unstructured":"T. Long, \u201cA Note on Cosparse Polynomial Time Turing Complete Sets for NP,\u201d to appear."},{"key":"10.1016\/0022-0000(82)90002-2_BIB14","article-title":"Sparse NP-Complete Sets","author":"Mahaney","year":"1981"},{"key":"10.1016\/0022-0000(82)90002-2_BIB15","article-title":"With What Frequency Are Apparently Intractable Problems Difficult?","author":"Meyer","year":"1979","journal-title":"MIT Technical Report"},{"key":"10.1016\/0022-0000(82)90002-2_BIB16","series-title":"Proceedings, 13th Annual Symposium on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential time","author":"Meyer","year":"1972"},{"key":"10.1016\/0022-0000(82)90002-2_BIB17","series-title":"Fourth International Colloquium on Automata, Languages, and Programming","first-page":"480","article-title":"On the difference between one and many","volume":"Vol. 52","author":"Simon","year":"1977"},{"key":"10.1016\/0022-0000(82)90002-2_BIB18","unstructured":"J. Simon and S. Mahaney, to appear."},{"key":"10.1016\/0022-0000(82)90002-2_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(82)90002-2_BIB20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"On the complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900022?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000082900022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:50:19Z","timestamp":1550307019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000082900022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["0022000082900022"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(82)90002-2","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}