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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computational complexity Jg. 24; H. 4; S. 851 - 879
Hauptverfasser:	Alon, Noga, Cohen, Gil
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.12.2015
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!