On the hardness of learning sparse parities

This work investigates the hardness of computing sparse solutions to systems of linear equations over F_2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F_2 on n variables, decide if there exists a nonzero solution of Hamming weight at most k (i.e. a k-sparse so...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2015-11
Hauptverfasser:	Bhattacharyya, Arnab, Gadekar, Ameet, Ghoshal, Suprovat, Saket, Rishi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Hardness Learning Linear equations Polynomials Traveling salesman problem Weight
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!