scientific article; zbMATH DE number 6862104

DOI10.4230/LIPICS.STACS.2017.12zbMATH Open1402.68069arXiv1701.06268MaRDI QIDQ4636610FDOQ4636610

Srikanth Srinivasan, Abhishek Bhrushundi, Prahladh Harsha

Publication date: 19 April 2018

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

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• Approximate factorization of polynomials in Z[x]
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• On polynomial approximations to AC 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximate factorization of polynomials in Z[x] 👍 👎
• Title not available (Why is that?) 👍 👎
• Approximate factorization of polynomials over Z 👍 👎
• Estimating polynomials over \(\mathbb Z_p\) at points from \(\mathbb C_p\) 👍 👎
• Title not available (Why is that?) 👍 👎
• Polynomial functions on the units of Z_{2^n} 👍 👎
• Title not available (Why is that?) 👍 👎

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)