Solving Linear Equations Parameterized by Hamming Weight

Given a system of linear equations A x = b over the binary field F 2 and an integer t ≥ 1 , we study the following three algorithmic problems: Does A x = b have a solution of weight at most t ? Does A x = b have a solution of weight exactly t ? Does A x = b have a solution of weight at least t ? We...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 75; H. 2; S. 322 - 338
Hauptverfasser:	Arvind, V., Köbler, Johannes, Kuhnert, Sebastian, Torán, Jacobo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2016
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Graph Match Problem Brute Force Search Deterministic Polynomial Time Internal Vertex Logarithmic Space
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!