Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions

DOI10.1137/20M1310321OpenAlexW4307888110MaRDI QIDQ5048295

Amir Shpilka, Yuval Rabani

Publication date: 15 November 2022

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/20m1310321

zbMATH Keywords

derandomizationhitting setsexplicit construction\(\epsilon\)-net

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Theory of computing (68Q99)

Cites Work

• Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions

This page was built for publication: Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions