{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:26:12Z","timestamp":1742930772587,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_5","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"50-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algebraic Proof of the Real Number PCP Theorem"],"prefix":"10.1007","author":[{"given":"Martijn","family":"Baartse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Meer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"3","key":"5_CR1","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. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR2","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$$. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Baartse, M., Meer, K.: The PCP theorem for NP over the reals. Foundations of Computational Mathematics 15(3), 651\u2013680 (2015). (Springer)","DOI":"10.1007\/s10208-014-9188-x"},{"key":"5_CR4","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. 604, pp. 1\u201353. American Mathematical Society (2013)","DOI":"10.1090\/conm\/604\/12067"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-319-06686-8_7","volume-title":"Computer Science - Theory and Applications","author":"M Baartse","year":"2014","unstructured":"Baartse, M., Meer, K.: Testing low degree trigonometric polynomials. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 77\u201396. Springer, Heidelberg (2014)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, Heidelberg (1998)","DOI":"10.1007\/978-1-4612-0701-6"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/1236457.1236459","volume":"54","author":"I Dinur","year":"2007","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM 54(3), 12 (2007)","journal-title":"J. ACM"},{"issue":"4","key":"5_CR8","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 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Meer, K.: Transparent long proofs: A first PCP theorem for NP$$_\\mathbb{R}$$. Found. Comput. Math. 5(3), 231\u2013255 (2005). (Springer)","DOI":"10.1007\/s10208-005-0142-1"},{"key":"5_CR10","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$$_\\mathbb{R}$$. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 41\u201352. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T06:14:27Z","timestamp":1676960067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}