On Rigid Matrices and U-Polynomials

We introduce a class of polynomials, which we call U - polynomials , and show that the problem of explicitly constructing a rigid matrix can be reduced to the problem of explicitly constructing a small hitting set for this class. We prove that small-bias sets are hitting sets for the class of U -pol...

Celý popis

Podrobná bibliografia

Vydané v:	Computational complexity Ročník 24; číslo 4; s. 851 - 879
Hlavní autori:	Alon, Noga, Cohen, Gil
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.12.2015
Predmet:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science small-bias sets Matrix rigidity unbalanced expanders 68Q17 68R05
ISSN:	1016-3328, 1420-8954
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!