scientific article; zbMATH DE number 6862104

DOI10.4230/LIPICS.STACS.2017.12MaRDI QIDQ4636610zbMATH OpenFDO

Authors Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1701.06268

zbMATH Keywords

Boolean functionsapproximation by polynomialspolynomials over ringsnon-classical polynomials

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Polynomials over finite fields (11T06)

Recommendations

• scientific article; zbMATH DE number 421690
• On polynomial approximations to \(\mathrm{AC}^0\)
• scientific article; zbMATH DE number 6861917
• Approximate factorization of polynomials in Z[x]
• scientific article; zbMATH DE number 4212684
• Approximate factorization of polynomials over Z
• Estimating polynomials over Z_p at points from C_p
• scientific article; zbMATH DE number 818427
• Polynomial functions on the units of \(\mathbb{Z}_{2^n}\)
• scientific article; zbMATH DE number 4067511

Cited in

(3)

• Approximate factorization of polynomials in Z[x]
• scientific article; zbMATH DE number 6861917 (Why is no real title available?)
• scientific article; zbMATH DE number 7559056 (Why is no real title available?)

This page was built for publication:

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