A PCP of proximity for real algebraic polynomials
type: Item
instance of: scholarly article
title: A PCP of proximity for real algebraic polynomials
DOI: 10.1007/978-3-030-79416-3_16
author: Klaus Meer
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493536
MaRDI profile type: Publication
full work available at URL: 978-3-030-79416-3 16
OpenAlex ID: W3176064637
cites work: Proof verification and the hardness of approximation problems
cites work: Probabilistic checking of proofs
cites work: Q4258216
cites work: The PCP theorem for NP over the reals
cites work: An algebraic proof of the real number PCP theorem
cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
cites work: COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
cites work: On the power of two-point based sampling
cites work: The PCP theorem by gap amplification
cites work: Q4335195
cites work: Introduction to Property Testing
cites work: Interpolation Processes
cites work: Almost Transparent Short Proofs for NPℝ
cites work: 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
Recommended article: An algebraic proof of the real number PCP theorem
Recommended article: An Algebraic Proof of the Real Number PCP Theorem
Recommended article: On copositive approximation by algebraic polynomials
Recommended article: An extremal problem for real algebraic polynomials
Recommended article: Algorithmic regularity for polynomials and applications
Recommended article: Real and complex pseudozero sets for polynomials with applications
Recommended article: Some relations between approximation problems and PCPs over the real numbers
Recommended article: Q3444556
Recommended article: Q3477437
Recommended article: New Computational Paradigms
description: scientific article; zbMATH DE number 7493536