A PCP of proximity for real algebraic polynomials

DOI10.1007/978-3-030-79416-3_16OpenAlexW3176064637MaRDI QIDQ2117096FDOQ2117096

Klaus Meer

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_16

Recommendations

• An algebraic proof of the real number PCP theorem
• An Algebraic Proof of the Real Number PCP Theorem
• On copositive approximation by algebraic polynomials
• An extremal problem for real algebraic polynomials
• Algorithmic regularity for polynomials and applications
• Real and complex pseudozero sets for polynomials with applications
• Some relations between approximation problems and PCPs over the real numbers
• [[:Publication:3444556|Title not available (Why is that?)]]
• [[:Publication:3477437|Title not available (Why is that?)]]
• New Computational Paradigms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Proof verification and the hardness of approximation problems
• Probabilistic checking of proofs
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
• Interpolation Processes
• Title not available (Why is that?)
• On the power of two-point based sampling
• The PCP theorem by gap amplification
• Introduction to Property Testing
• Title not available (Why is that?)
• The PCP theorem for NP over the reals
• An algebraic proof of the real number PCP theorem
• Recent advances in real complexity and computation. UIMP-RSME Lluís Santaló summer school, Universidad Internacional Menéndez Pelayo, Santander, Spain, July 16--20, 2012
• Almost Transparent Short Proofs for NPℝ

Cited In (1)

• An Algebraic Proof of the Real Number PCP Theorem

This page was built for publication: A PCP of proximity for real algebraic polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117096)