Asymptotically Optimal Hitting Sets Against Polynomials
From MaRDI portal
Publication:3521931
DOI10.1007/978-3-540-70575-8_29zbMath1153.68569OpenAlexW1527512254MaRDI QIDQ3521931
Moritz Hardt, Markus Bläser, David Steurer
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70575-8_29
Related Items (7)
Exact learning from an honest teacher that answers membership queries ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Unnamed Item ⋮ Deterministically testing sparse polynomial identities of unbounded degree ⋮ Building above read-once polynomials: identity testing and hardness of representation ⋮ On hitting-set generators for polynomials that vanish rarely ⋮ Sharp concentration of hitting size for random set systems
This page was built for publication: Asymptotically Optimal Hitting Sets Against Polynomials
