{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T15:27:38Z","timestamp":1703086058896},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00073-9","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"193-219","source":"Crossref","is-referenced-by-count":6,"title":["Geometric sets of low information content"],"prefix":"10.1016","volume":"158","author":[{"given":"M.","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Arvind","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00073-9_BIB1","series-title":"Complexity Theory, Current Research","first-page":"1","article-title":"Reductions to sets of low information content","author":"Arvind","year":"1993"},{"key":"10.1016\/0304-3975(95)00073-9_BIB2","series-title":"Proc. 12th Conf. FSTTCS","first-page":"140","article-title":"On bounded truth-table, conjunctive, and randomized reductions to sparse sets","volume":"Vol. 652","author":"Arvind","year":"1992"},{"key":"10.1016\/0304-3975(95)00073-9_BIB3","doi-asserted-by":"crossref","unstructured":"V. Arvind, J. K\u00f6bler and M. Mundhenk, Upper bounds for the complexity of sparse and tally descriptions, Math. Systems Theory, to appear.","DOI":"10.1007\/s002240000006"},{"key":"10.1016\/0304-3975(95)00073-9_BIB4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0022-0000(90)90025-G","article-title":"Self-reducibility","volume":"41","author":"Balc\u00e1zar","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00073-9_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","article-title":"Structural Complexity I,II","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0304-3975(95)00073-9_BIB6","series-title":"Proc. 9th Structure in Complexity Theory Conf.","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/0304-3975(95)00073-9_BIB7","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0304-3975(95)00073-9_BIB8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","article-title":"On relativized exponential and probabilistic complexity classes","volume":"71","author":"Heller","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)00073-9_BIB9","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(90)90081-R","article-title":"Relations among mod-classes","volume":"74","author":"Hertrampf","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00073-9_BIB10","series-title":"An Introduction to Neural Computation","author":"Hertz","year":"1991"},{"issue":"2","key":"10.1016\/0304-3975(95)00073-9_BIB11","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial-time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00073-9_BIB12","series-title":"Proc. 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/0304-3975(95)00073-9_BIB13_1","first-page":"1093","article-title":"A polynomial-time algorithm for linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Doklady Akad. Nauk USSR"},{"key":"10.1016\/0304-3975(95)00073-9_BIB13_2","first-page":"191","volume":"20","author":"Khachian","year":"1979","journal-title":"Soviet Math. Doklady"},{"key":"10.1016\/0304-3975(95)00073-9_BIB14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","article-title":"On self-reducibility and weak p-selectivity","volume":"26","author":"Ko","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00073-9_BIB15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02090392","article-title":"Self-reducible sets of small density","volume":"24","author":"Lozano","year":"1991","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(95)00073-9_BIB16","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1145\/146585.146605","article-title":"Algebraic methods for interactive proof systems","volume":"39","author":"Lund","year":"1992","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(95)00073-9_BIB17","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00073-9_BIB18","series-title":"Perceptrons","author":"Minsky","year":"1988"},{"key":"10.1016\/0304-3975(95)00073-9_BIB19","series-title":"Proc. 9th Structure in Complexity Theory Conf.","article-title":"Polynomial time membership comparable sets","author":"Ogihara","year":"1994"},{"key":"10.1016\/0304-3975(95)00073-9_BIB20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(93)90020-T","article-title":"On one query self-reducible sets","volume":"112","author":"Ogiwara","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(95)00073-9_BIB21","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/0220030","article-title":"On polynomial-time bounded truth-table reducibility of NP sets to sparse sets","volume":"20","author":"Ogiwara","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00073-9_BIB22","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1137\/0209054","article-title":"The application of multivariate polynomials to inference rules and partial tests for unsatisfiability","volume":"9","author":"Plaisted","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00073-9_BIB23","article-title":"On unbounded reductions of NP sets to tally sets","author":"Saluja","year":"1993","journal-title":"Manuscript"},{"key":"10.1016\/0304-3975(95)00073-9_BIB24","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1145\/146585.146613","article-title":"IP = PSPACE, a simplified proof","volume":"39","author":"Shen","year":"1992","journal-title":"Journal of ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:24:12Z","timestamp":1556508252000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595000739"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00073-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}