scientific article; zbMATH DE number 7758309

DOI10.4230/lipics.approx/random.2020.7MaRDI QIDQ6084350

Amnon Ta-Shma, Dean Doron, Roei Tell

Publication date: 31 October 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomials over finite fieldshitting-set generatorsquantified derandomization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness is linear in space
• Improved bounds for quantified derandomization of constant-depth circuits and polynomials
• Hilbert functions and the finite degree Zariski closure in finite field combinatorial geometry
• Extractors from Reed-Muller codes
• On the structure of cubic and quartic polynomials
• Reed–Muller Codes for Random Erasures and Errors
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Simple extractors for all min-entropies and a new pseudorandom generator
• Extractor Codes
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Randomness efficient identity testing of multivariate polynomials
• Weight Distribution and List-Decoding Size of Reed–Muller Codes
• On the weight structure of Reed-Muller codes
• Weight enumerator for second-order Reed-Muller codes

This page was built for publication: