{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:16Z","timestamp":1775282296665,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705741","type":"print"},{"value":"9783540705758","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_29","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"345-356","source":"Crossref","is-referenced-by-count":6,"title":["Asymptotically\u00a0Optimal\u00a0Hitting\u00a0Sets Against\u00a0Polynomials"],"prefix":"10.1007","author":[{"given":"Markus","family":"Bl\u00e4ser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Hardt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Steurer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"29_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N. Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput.\u00a08(1-2), 7\u201329 (1999)","journal-title":"Comb. Probab. Comput."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"De Millo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. IPL 7 (1978)","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"29_CR3","first-page":"216","volume-title":"Proc. ISSAC","author":"R. Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proc. ISSAC, pp. 216\u2013226. Springer, Berlin (1979)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. Schwartz","year":"1980","unstructured":"Schwartz, J.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM\u00a027, 701\u2013717 (1980)","journal-title":"Journal of the ACM"},{"issue":"5","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/S0097539793250330","volume":"24","author":"S. Chari","year":"1995","unstructured":"Chari, S., Rohatgi, P., Srinivasan, A.: Randomness-optimal unique element isolation with applications to perfect matching and related problems. SIAM J. Comput.\u00a024(5), 1036\u20131050 (1995)","journal-title":"SIAM J. Comput."},{"key":"29_CR6","unstructured":"Lov\u00e1sz, L.: On determinants, matchings, and random algorithms. In: FCT, pp. 565\u2013574 (1979)"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02579206","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica\u00a07(1), 105\u2013113 (1987)","journal-title":"Combinatorica"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","volume":"10","author":"M. Blum","year":"1980","unstructured":"Blum, M., Chandra, A.K., Wegman, M.N.: Equivalence of free boolean graphs can be decided probabilistically in polynomial time. IPL\u00a010, 80\u201382 (1980)","journal-title":"IPL"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum, M., Kannan, S.: Designing programs that check their work. J. ACM\u00a042(1), 269\u2013291 (1995)","journal-title":"J. ACM"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/792538.792540","volume":"50","author":"M. Agrawal","year":"2003","unstructured":"Agrawal, M., Biswas, S.: Primality and identity testing via chinese remaindering. J. ACM\u00a050(4), 429\u2013443 (2003)","journal-title":"J. ACM"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. of Math (2)\u00a0160(2), 781\u2013793 (2004)","journal-title":"Ann. of Math. (2)"},{"issue":"4","key":"29_CR12","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM\u00a039(4), 869\u2013877 (1992)","journal-title":"J. ACM"},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C. Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM\u00a039(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"29_CR15","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"key":"29_CR16","first-page":"92","volume-title":"Proc. 25th FSTTCS","author":"M. Agrawal","year":"2005","unstructured":"Agrawal, M.: Proving lower bounds via pseudo-random generators. In: Proc. 25th FSTTCS, pp. 92\u2013105. Springer, Heidelberg (2005)"},{"issue":"5","key":"29_CR17","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/05063605X","volume":"36","author":"Z. Dvir","year":"2007","unstructured":"Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput.\u00a036(5), 1404\u20131434 (2007)","journal-title":"SIAM J. Comput."},{"key":"29_CR18","first-page":"9","volume-title":"Proc. 21st CCC","author":"N. Kayal","year":"2006","unstructured":"Kayal, N., Saxena, N.: Polynomial identity testing for depth 3 circuits. In: Proc. 21st CCC, pp. 9\u201317. IEEE, Los Alamitos (2006)"},{"key":"29_CR19","first-page":"284","volume-title":"Proc. 39th STOC","author":"A. Shpilka","year":"2007","unstructured":"Shpilka, A.: Interpolation of depth-3 arithmetic circuits with two multiplication gates. In: Proc. 39th STOC, pp. 284\u2013293. ACM, New York (2007)"},{"issue":"1\/2","key":"29_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-004-0182-6","volume":"13","author":"V. Kabanets","year":"2004","unstructured":"Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex.\u00a013(1\/2), 1\u201346 (2004)","journal-title":"Comput. Complex."},{"issue":"4","key":"29_CR21","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1137\/S0097539798341600","volume":"29","author":"Z.Z. Chen","year":"2000","unstructured":"Chen, Z.Z., Kao, M.Y.: Reducing randomness via irrational numbers. SIAM J. Comput.\u00a029(4), 1247\u20131256 (2000)","journal-title":"SIAM J. Comput."},{"key":"29_CR22","first-page":"437","volume-title":"Proc. 30th STOC","author":"D. Lewin","year":"1998","unstructured":"Lewin, D., Vadhan, S.: Checking polynomial identities over any field: Towards a derandomization? In: Proc. 30th STOC, pp. 437\u2013438. ACM, New York (1998)"},{"key":"29_CR23","first-page":"216","volume-title":"Proc. 33th STOC","author":"A. Klivans","year":"2001","unstructured":"Klivans, A., Spielman, D.A.: Randomness efficient identity testing of multivariate polynomials. In: Proc. 33th STOC, pp. 216\u2013223. ACM, New York (2001)"},{"key":"29_CR24","first-page":"21","volume-title":"Proc. 37th STOC","author":"A. Bogdanov","year":"2005","unstructured":"Bogdanov, A.: Pseudorandom generators for low degree polynomials. In: Proc. 37th STOC, pp. 21\u201330. ACM, New York (2005)"},{"issue":"1","key":"29_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/322358.322373","volume":"30","author":"O.H. Ibarra","year":"1983","unstructured":"Ibarra, O.H., Moran, S.: Probabilistic algorithms for deciding equivalence of straight-line programs. J. ACM\u00a030(1), 217\u2013228 (1983)","journal-title":"J. ACM"},{"key":"29_CR26","first-page":"756","volume-title":"Proc. SODA","author":"R. Lipton","year":"2003","unstructured":"Lipton, R., Vishnoi, N.: Deterministic identity testing for multivariate polynomials. In: Proc. SODA, pp. 756\u2013760. ACM, New York (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:27:02Z","timestamp":1714620422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}