Testing Low Degree Trigonometric Polynomials

DOI10.1007/978-3-319-06686-8_7MaRDI QIDQ4981151zbMATH OpenOpenAlexFDO

Authors Martijn Baartse, Klaus Meer

Publication date 24 June 2014

Published in Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-06686-8_7

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computation over the reals, computable analysis (03D78) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Testing polynomials
• Testing degenerate polynomials
• Test polynomials
• On trigonometric polynomials least deviating from zero
• Testing low-degree polynomials over prime fields
• scientific article; zbMATH DE number 2219805
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• scientific article; zbMATH DE number 1180257
• On trigonometric polynomials
• Testing for trigonometric polynomial in nonparametric regression model

Cited in

(4)

• The PCP theorem for NP over the reals
• An algebraic proof of the real number PCP theorem
• An Algebraic Proof of the Real Number PCP Theorem
• Low-degree test with polynomially small error

This page was built for publication: Testing Low Degree Trigonometric Polynomials

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