{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:10:21Z","timestamp":1736287821392,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_37","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"455-468","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Leen","family":"Torenvliet","sequence":"additional","affiliation":[]},{"given":"Falk","family":"Unger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(95)00167-0","volume":"158","author":"M. Agrawal","year":"1996","unstructured":"Agrawal, M., Arvind, V.: Quasi-linear truth-table reductions to p-selective sets. Theoretical Computer Science\u00a0158, 361\u2013370 (1996)","journal-title":"Theoretical Computer Science"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1006\/inco.1995.1115","volume":"120","author":"R. Beigel","year":"1995","unstructured":"Beigel, R., Kummer, M., Stephan, F.: Approximable sets. Information and Computation\u00a0120, 304\u2013314 (1995)","journal-title":"Information and Computation"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"Berman, L., Hartmanis, H.: On isomorphisms and density of NP and other complete sets. SIAM J. Comput.\u00a06, 305\u2013322 (1977)","journal-title":"SIAM J. Comput."},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Fortnow, L., Thierauf, T.: Nonrelativizing separations. In: IEEE Conference on Computational Complexity, pp. 8\u201312. IEE Computer Society Press (1998)","DOI":"10.1109\/CCC.1998.694585"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1006\/jcss.1996.0062","volume":"53","author":"H. Buhrman","year":"1996","unstructured":"Buhrman, H., Torenvliet, L.: P-selective self-reducible sets: A new characterization of P. J. Computer and System Sciences\u00a053, 210\u2013217 (1996)","journal-title":"J. Computer and System Sciences"},{"key":"37_CR6","volume-title":"Proceedings of the 20th IEEE Conference on Computationa Complexity","author":"L. Fortnow","year":"2005","unstructured":"Fortnow, L., Klivans, A.: NP with small advice. In: Proceedings of the 20th IEEE Conference on Computationa Complexity, IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"37_CR7","volume-title":"Monographs in Theoretical Computer Science","author":"L. Hemaspaandra","year":"2002","unstructured":"Hemaspaandra, L., Torenvliet, L.: Theory of Semi-Feasible Algorithms. In: Monographs in Theoretical Computer Science, Springer, Heidelberg (2002)"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","volume":"26","author":"K.I. Ko","year":"1983","unstructured":"Ko, K.I.: On self-reducibility and weak P-selectivity. J. Comput. System Sci.\u00a026, 209\u2013211 (1983)","journal-title":"J. Comput. System Sci."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/0214003","volume":"14","author":"K. Ko","year":"1985","unstructured":"Ko, K., Sch\u00f6ning, U.: On circuit-size and the low hierarchy in NP. SIAM J. Comput.\u00a014, 41\u201351 (1985)","journal-title":"SIAM J. Comput."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Lozano, A., Tor\u00e1n, J.: Self-reducible sets of small density. Mathematical Systems Theory (1991)","DOI":"10.1007\/BF02090392"},{"key":"37_CR11","unstructured":"Meyer, A.: oral communication. cited in [3] (1977)"},{"key":"37_CR12","unstructured":"Mocas, S.: Separating Exponential Time Classes from Polynomial Time Classes. PhD thesis, Northeastern University (1993)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/S0097539793258131","volume":"24","author":"M. Ogihara","year":"1995","unstructured":"Ogihara, M.: Polynomial-time membership comparable sets. SIAM Journal on Computing\u00a024, 1168\u20131181 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1137\/0220030","volume":"20","author":"M. Ogiwara","year":"1991","unstructured":"Ogiwara, M., Watanabe, O.: On polynomial time bounded truth-table reducibility of NP sets to sparse sets. SIAM J. Comput.\u00a020, 471\u2013483 (1991)","journal-title":"SIAM J. Comput."},{"key":"37_CR15","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01744288","volume":"13","author":"A. Selman","year":"1979","unstructured":"Selman, A.: P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Math. Systems Theory\u00a013, 55\u201365 (1979)","journal-title":"Math. Systems Theory"},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/S0019-9958(82)80084-3","volume":"52","author":"A. Selman","year":"1982","unstructured":"Selman, A.: Analogues of semicursive sets and effective reducibilities to the study of NP complexity. Information and Control\u00a052, 36\u201351 (1982)","journal-title":"Information and Control"},{"key":"37_CR18","unstructured":"Shaltiel, R., Umans, C.: Pseudorandomness for approximate counting and sampling. Technical Report TR04-086, ECCC (2004)"},{"key":"37_CR19","first-page":"260","volume-title":"Proc. 3rd Structure in Complexity in Conference","author":"K. Wagner","year":"1988","unstructured":"Wagner, K.: Bounded query computations. In: Proc. 3rd Structure in Complexity in Conference, pp. 260\u2013278. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","volume":"31","author":"C. Wilson","year":"1985","unstructured":"Wilson, C.: Relativized circuit complexity. J. Comput. System Sci.\u00a031, 169\u2013181 (1985)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:55:19Z","timestamp":1736286919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11672142_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}