scientific article; zbMATH DE number 4182832

MaRDI QIDQ5748889zbMATH OpenFDO

Authors Marek Karpinski

Publication date 1989

zbMATH Keywords

finite fieldspolynomial interpolation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
• Very Fast Parallel Polynomial Arithmetic
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• scientific article; zbMATH DE number 1114028

Cited in

(9)

• The complexity of sparse polynomial interpolation over finite fields
• On some approximation problems concerning sparse polynomials over finite fields
• Sparse Boolean equations and circuit lattices
• Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
• scientific article; zbMATH DE number 1114028 (Why is no real title available?)
• Luby-Veličković-Wigderson revisited: improved correlation bounds and pseudorandom generators for depth-two circuits
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• Bootstrapping variables in algebraic circuits
• Efficiently testing sparse \(\text{GF}(2)\) polynomials

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 Q5748889)