{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:18:30Z","timestamp":1778296710278,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540557197","type":"print"},{"value":"9783540472780","type":"electronic"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55719-9_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:34:14Z","timestamp":1330252454000},"page":"162-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Reductions to sets of low information content"],"prefix":"10.1007","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Hemachandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Mundhenk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ogiwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Sch\u00f6ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Thierauf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 232\u2013243. IEEE Computer Society Press, July 1990.","DOI":"10.1109\/SCT.1990.113971"},{"key":"14_CR2","unstructured":"E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing. To appear. Preliminary version appears as [AHOW91]."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 220\u2013229. IEEE Computer Society Press, June\/July 1991.","DOI":"10.1109\/SCT.1991.160264"},{"key":"14_CR4","unstructured":"V. Arvind, J. K\u00f6bler, and M. Mundhenk. Bounded truth-table and conjunctive reductions to sparse and tally sets. In preparation."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"P. Berman. Relationship between density and deterministic complexity of NP-complete languages. In Proceedings of the 5th International Colloquium on Automata, Languages, and Programming, pages 63\u201371. Springer-Verlag Lecture Notes in Computer Science #62, 1978.","DOI":"10.1007\/3-540-08860-1_6"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"R. Beigel, J. Gill, and U. Hertrampf. Counting classes: Thresholds, parity, mods, and fewness. In Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, pages 49\u201357. Springer-Verlag Lecture Notes in Computer Science #415, February 1990.","DOI":"10.1007\/3-540-52282-4_31"},{"issue":"2","key":"14_CR7","doi-asserted-by":"publisher","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(2):305\u2013322, 1977.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"14_CR8","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1137\/0217056","volume":"17","author":"R. Book","year":"1988","unstructured":"R. Book and K. Ko. On sets truth-table reducible to sparse sets. SIAM Journal on Computing, 17(5):903\u2013919, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR9","unstructured":"H. Buhrman, L. Longpr\u00e9, and E. Spaan, 1992. Personal Communication."},{"issue":"6","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1137\/0217078","volume":"17","author":"J. Cai","year":"1988","unstructured":"J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232\u20131252, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/0218007","volume":"18","author":"J. Cai","year":"1989","unstructured":"J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy II: Applications. SIAM Journal on Computing, 18(1):95\u2013111, 1989.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"14_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02090768","volume":"23","author":"J. Cai","year":"1990","unstructured":"J. Cai and L. Hemachandra. On the power of parity polynomial time. Mathematical Systems Theory, 23(2):95\u2013106, 1990.","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"14_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(91)90103-O","volume":"38","author":"J. Cai","year":"1991","unstructured":"J. Cai and L. Hemachandra. A note on enumerative counting. Information Processing Letters, 38(4):215\u2013219, 1991.","journal-title":"Information Processing Letters"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0208034","volume":"8","author":"S. Fortune","year":"1979","unstructured":"S. Fortune. A note on sparse complete sets. SIAM Journal on Computing, 8(3):431\u2013433, 1979.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR15","unstructured":"R. Gavald\u00e0. On conjunctive and disjunctive reductions to sparse sets. Manuscript, January 1992."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"R. Gavald\u00e0 and O. Watanabe. On the computational complexity of small descriptions. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 89\u2013101. IEEE Computer Society Press, June\/July 1991.","DOI":"10.1109\/SCT.1991.160247"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","volume":"71","author":"H. Heller","year":"1986","unstructured":"H. Heller. On relativized exponential and probabilistic complexity classes. Information and Control, 71:231\u2013243, 1986.","journal-title":"Information and Control"},{"issue":"6","key":"14_CR18","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/0220071","volume":"20","author":"L. Hemachandra","year":"1991","unstructured":"L. Hemachandra and A. Hoene. On sets with efficient implicit membership tests. SIAM Journal on Computing, 20(6):1148\u20131156, 1991.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"S. Homer and L. Longpr\u00e9. On reductions of NP sets to sparse sets. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 79\u201388. IEEE Computer Society Press, June\/July 1991.","DOI":"10.1109\/SCT.1991.160246"},{"key":"14_CR20","unstructured":"L. Hemachandra, M. Ogiwara, and O. Watanabe. How hard are sparse sets? In preparation (will appear in the Proceedings of the 7th Structure in Complexity Theory Conference)."},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(89)90164-3","volume":"68","author":"N. Immerman","year":"1989","unstructured":"N. Immerman and S. Mahaney. Relativizing relativized computations. Theoretical Computer Science, 68:267\u2013276, 1989.","journal-title":"Theoretical Computer Science"},{"key":"14_CR22","doi-asserted-by":"publisher","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:225\u2013237, 1985.","journal-title":"Theoretical Computer Science"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"D. Joseph and P. Young. Self-reducibility: Effects of internal structure on computational complexity. In A. Selman, editor, Complexity Theory Retrospective, pages 82\u2013107. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4612-4478-3_6"},{"issue":"3","key":"14_CR24","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0022-0000(89)90024-X","volume":"39","author":"J. Kadin","year":"1989","unstructured":"J. Kadin. pNP[logn] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282\u2013298, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302\u2013309, April 1980.","DOI":"10.1145\/800141.804678"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails relative to a random oracle. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 157\u2013166. ACM Press, May 1989.","DOI":"10.1145\/73007.73022"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0890-5401(89)90029-1","volume":"81","author":"K. Ko","year":"1989","unstructured":"K. Ko. Distinguishing conjunctive and disjunctive reducibilities by sparse sets. Information and Computation, 81(1):62\u201387, 1989.","journal-title":"Information and Computation"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"K. Ko, P. Orponen, U. Sch\u00f6ning, and O. Watanabe. What is a hard instance of a computational problem? In Proceedings of the 1st Structure in Complexity Theory Conference, pages 197\u2013217. Springer-Verlag Lecture Notes in Computer Science #223, June 1986.","DOI":"10.1007\/3-540-16486-3_99"},{"issue":"2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibihties. Theoretical Computer Science, 1(2):103\u2013124, 1975.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","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 System Sciences, 25(2):130\u2013143, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR31","unstructured":"S. Mahaney. Sparse sets and reducibilities. In R. Book, editor, Studies in Complexity Theory, pages 63\u2013118. John Wiley and Sons, 1986."},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"S. Mahaney. The isomorphism conjecture and sparse sets. In J. Hartmanis, editor, Computational Complexity Theory, pages 18\u201346. American Mathematical Society, 1989. Proceedings of Symposia in Applied Mathematics #38.","DOI":"10.1090\/psapm\/038\/1020808"},{"key":"14_CR33","unstructured":"P. Orponen, K. Ko, U. Sch\u00f6ning, and O. Watanabe. Instance complexity. Journal of the ACM. To appear."},{"key":"14_CR34","unstructured":"M. Ogiwara and A. Lozano. On one-query self-reducible sets. Theoretical Computer Science. To appear. Preliminary version appears as [OL91]."},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"M. Ogiwara and A. Lozarto. On one-query self-reducible sets. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 139\u2013151. IEEE Computer Society Press, June\/July 1991.","DOI":"10.1109\/SCT.1991.160254"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"P. Orponen. On the instance complexity of NP-hard problems. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 20\u201327. IEEE Computer Society Press, July 1990.","DOI":"10.1109\/SCT.1990.113951"},{"issue":"3","key":"14_CR37","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/0220030","volume":"20","author":"M. Ogiwara","year":"1991","unstructured":"M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471\u2013483, June 1991.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR38","unstructured":"D. Ranjan and P. Rohatgi. On randomized reductions to sparse sets. In Proceedings of the 7th Structure in Complexity Theory Conference. IEEE Computer Society Press. To appear."},{"issue":"3","key":"14_CR39","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1137\/0212038","volume":"12","author":"E. Ukkonen","year":"1983","unstructured":"E. Ukkonen. Two results on polynomial time truth-table reductions to sparse sets. SIAM Journal on Computing, 12(3):580\u2013587, 1983.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"14_CR40","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833\u2013846, 1990.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"O. Watanabe. On 1\u2212tt p sparseness and nondeterministic complexity classes. In Proceedings of the 15th International Colloquium on Automata, Languages, and Programming, pages 697\u2013709. Springer-Verlag Lecture Notes in Computer Science #317, July 1988.","DOI":"10.1007\/3-540-19488-6_151"},{"key":"14_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02090387","volume":"24","author":"O. Watanabe","year":"1991","unstructured":"O. Watanabe. On intractability of the class UP. Mathematical Systems Theory, 24:1\u201310, 1991.","journal-title":"Mathematical Systems Theory"},{"key":"14_CR43","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","volume":"26","author":"C. Yap","year":"1983","unstructured":"C. Yap. Some consequences of non-uniform conditions on uniform classes. Theoretical Computer Science, 26:287\u2013300, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"14_CR44","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0212027","volume":"12","author":"Y. Yesha","year":"1983","unstructured":"Y. Yesha. On certain polynomial-time truth-table reducibilities of complete sets to sparse sets. SIAM Journal on Computing, 12(3):411\u2013425, 1983.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55719-9_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:42:08Z","timestamp":1742593328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55719-9_72"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540557197","9783540472780"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-55719-9_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}