Efficiently Testing Sparse GF(2) Polynomials

DOI10.1007/978-3-540-70575-8_41zbMath1153.68570arXiv0805.1765OpenAlexW2803206283MaRDI QIDQ3521943

Kevin Matulef, Ilias Diakonikolas, Andrew Wan, Homin K. Lee, Rocco A. Servedio

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (4)

A local decision test for sparse polynomials ⋮ Efficient Sample Extractors for Juntas with Applications ⋮ Testing by Implicit Learning: A Brief Survey ⋮ Unnamed Item

This page was built for publication: Efficiently Testing Sparse GF(2) Polynomials