乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:08Z","timestamp":1725564968907},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_22","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"188-197","source":"Crossref","is-referenced-by-count":1,"title":["Learning DNFs and Circuits Using Teaching Assistants"],"prefix":"10.1007","author":[{"given":"N. Variyam","family":"Vinodchandran","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Arvind, V., Kurur, P.: Graph isomorphism is in SPP. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 743\u2013750 (2002)","DOI":"10.1109\/SFCS.2002.1181999"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-61863-5_38","volume-title":"Algorithmic Learning Theory","author":"V. Arvind","year":"1996","unstructured":"Arvind, V., Vinodchandran, N.V.: The complexity of exactly learning algebraic concepts. In: Arikawa, S., Sharma, A.K. (eds.) ALT 1996. LNCS, vol.\u00a01160, pp. 100\u2013112. Springer, Heidelberg (1996)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(99)00266-2","volume":"241","author":"V. Arvind","year":"2000","unstructured":"Arvind, V., Vinodchandran, N.V.: Exact learning via teaching assistants. Theoretical Computer Science\u00a0241, 51\u201381 (2000) (special issue devoted to the 7th International Workshop on Algorithmic Learning Theory)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01263422","volume":"4","author":"R. Beigel","year":"1994","unstructured":"Beigel, R.: Perceptrons, PP, and the polynomial hierarchy. Computational Complexity\u00a04(4), 339\u2013349 (1994)","journal-title":"Computational Complexity"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jcss.1996.0032","volume":"52","author":"N. Bshouty","year":"1996","unstructured":"Bshouty, N., Cleve, R., Gavald\u00e0, R., Kannan, S., Tamon, C.: Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences\u00a052, 421\u2013433 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR7","unstructured":"Cai, J-Y.: \n \n \n \n $S^P_2$\n \u2286 ZPP\n NP\n . In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 620\u2013629 (2001)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/S0022-0000(05)80024-8","volume":"48","author":"S. Fenner","year":"1994","unstructured":"Fenner, S., Fortnow, L., Kurtz, S.: Gap-definable counting classes. Journal of Computer and System Sciences\u00a048, 116\u2013148 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1006\/jcss.1995.1032","volume":"50","author":"S. Gupta","year":"1995","unstructured":"Gupta, S.: Closure properties and witness reduction. Journal of Computer and System Sciences\u00a050(3), 412\u2013432 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","volume":"71","author":"H. Heller","year":"1986","unstructured":"Heller, H.: On relativized exponential and probabilistic complexity classes. Information and Control\u00a071, 231\u2013243 (1986)","journal-title":"Information and Control"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Hitchcock, J.M.: The size of SPP. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2004.02.029"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/S0097539700389652","volume":"31","author":"A. Klivans","year":"2002","unstructured":"Klivans, A., van Melkebeek, D.: Graph nonisomorhism has subexponential size proofs unless the polynomial-time hierarchy collapses. SIAM Journal on Computing\u00a031, 1501\u20131526 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01200427","volume":"2","author":"J. K\u00f6bler","year":"1992","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: Graph isomorphism is low for PP. Journal of Computational Complexity\u00a02, 301\u2013330 (1992)","journal-title":"Journal of Computational Complexity"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Ogiwara, M., Hemachandra, L.: A complexity theory of feasible closure properties. Journal of Computer and System Sciences, 295\u2013325 (1993)","DOI":"10.1016\/0022-0000(93)90006-I"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Vinodchandran, N.V.: Counting complexity of solvable group problems. SIAM Journal on Computing (2004) (to appear)","DOI":"10.1137\/S0097539703420651"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0022-0000(85)90040-6","volume":"31","author":"C.B. Wilson","year":"1985","unstructured":"Wilson, C.B.: Reltivized circuit complexity. Journal of Computer and System Sciences\u00a031(2), 169\u2013181 (1985)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:31Z","timestamp":1620012391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}