{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:48:06Z","timestamp":1742953686414,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_16","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"264-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A PCP of Proximity for Real Algebraic Polynomials"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Meer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"3","key":"16_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":"16_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":"16_CR3","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, Heidelberg (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Baartse, M., Meer, K.: The PCP theorem for NP over the reals. Found. Comput. Math. 15(3), 651\u2013680 (2015)","DOI":"10.1007\/s10208-014-9188-x"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Baartse, M., Meer, K.: An algebraic proof of the real number PCP theorem. J. Complex. 40, 34\u201377 (2017)","DOI":"10.1016\/j.jco.2016.11.006"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Goldreich, O., Harsha, P., Sudan, M., Vadhan, S.P.: Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM J. Comput. 36(4), 889\u2013974 (2006)","DOI":"10.1137\/S0097539705446810"},{"key":"16_CR7","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"},{"key":"16_CR8","volume-title":"An Introduction to the Theory of Infinite Series","author":"TJIA Bromwich","year":"1955","unstructured":"Bromwich, T.J.I.A.: An Introduction to the Theory of Infinite Series. Macmillan, London (1955)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B Chor","year":"1989","unstructured":"Chor, B., Goldreich, O.: On the power of two-point based sampling. J. Complex. 5, 96\u2013106 (1989)","journal-title":"J. Complex."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. J. ACM 54 (3) (2007)","DOI":"10.1145\/1236457.1236459"},{"key":"16_CR11","unstructured":"Friedl, K., H\u00e1ts\u00e1gi, Z., Shen, A.: Low-degree tests. In: Proceedings of SODA, pp. 57\u201364 (1994)"},{"key":"16_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/9781108135252","volume-title":"Introduction into Property Testing","author":"O Goldreich","year":"2017","unstructured":"Goldreich, O.: Introduction into Property Testing. Cambridge Univ, Press (2017)"},{"key":"16_CR13","volume-title":"Robust PCPs of Proximity and Shorter PCPs","author":"P Harsha","year":"2004","unstructured":"Harsha, P.: Robust PCPs of Proximity and Shorter PCPs. Massachusetts Institute of Technology, Cambridge, MA, USA (2004). http:\/\/www.tcs.tifr.res.in\/~prahladh\/papers\/thesis\/"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Mastroianni, G., Milovanic, G.: Interpolation processes. Springer Monographs in Mathematics (2008)","DOI":"10.1007\/978-3-540-68349-0"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Meer, K.: Almost Transparent Short Proofs for NP. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 41\u201352. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22953-4_4","DOI":"10.1007\/978-3-642-22953-4_4"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Monta\u00f1a, J.L., Pardo, L.M. (eds.): Recent Advances in Real Complexity and Computation. AMS Contemporary Mathematics, vol. 604 (2013)","DOI":"10.1090\/conm\/604"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:21:48Z","timestamp":1623972108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}