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

Celý popis

Podrobná bibliografie

Vydáno v:	Algorithmica Ročník 75; číslo 2; s. 322 - 338
Hlavní autoři:	Arvind, V., Köbler, Johannes, Kuhnert, Sebastian, Torán, Jacobo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2016
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!