Tight Bounds for Testing k-Linearity

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - Lecture Notes in Computer Science ◽

10.1007/978-3-642-32512-0_37 ◽

2012 ◽

pp. 435-446 ◽

Author(s):

Eric Blais ◽

Daniel Kane

Download Full-text