{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:30:01Z","timestamp":1725795001331},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_7","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T01:30:40Z","timestamp":1401672640000},"page":"77-96","source":"Crossref","is-referenced-by-count":2,"title":["Testing Low Degree Trigonometric Polynomials"],"prefix":"10.1007","author":[{"given":"Martijn","family":"Baartse","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Meer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"issue":"3","key":"7_CR2","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 hardness of approximation problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"issue":"1","key":"7_CR3","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 proofs: A new characterization of NP. Journal of the ACM\u00a045(1), 70\u2013122 (1998)","journal-title":"Journal of the ACM"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"7_CR5","unstructured":"Baartse, M., Meer, K.: The PCP theorem for NP over the reals. To appear in Foundations of Computational Mathematics. Springer"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Baartse, M., Meer, K.: Topics in real and complex number complexity theory. In: Montana, J.L., Pardo, L.M. (eds.) Recent Advances in Real Complexity and Computation, Contemporary Mathematics, vol.\u00a0604, pp. 1\u201353. American Mathematical Society (2013)","DOI":"10.1090\/conm\/604\/12067"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer (1998)","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc.\u00a021, 1\u201346 (1989)","journal-title":"Bull. Amer. Math. Soc."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer (1997)","DOI":"10.1007\/978-3-662-03338-8"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Journal of the ACM\u00a054(3) (2007)","DOI":"10.1145\/1236457.1236459"},{"key":"7_CR11","unstructured":"Friedl, K., H\u00e1ts\u00e1gi, Z., Shen, A.: Low-degree tests. In: Proc. SODA, pp. 57\u201364 (1994)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10208-005-0142-1","volume":"5","author":"K. Meer","year":"2005","unstructured":"Meer, K.: Transparent long proofs: A first PCP theorem for NP\u211d. Foundations of Computational Mathematics\u00a05(3), 231\u2013255 (2005)","journal-title":"Foundations of Computational Mathematics"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-22953-4_4","volume-title":"Fundamentals of Computation Theory","author":"K. Meer","year":"2011","unstructured":"Meer, K.: Almost transparent short proofs for NP\u211d. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 41\u201352. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T20:02:23Z","timestamp":1558900943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}