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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 75; no. 2; pp. 322 - 338
Main Authors:	Arvind, V., Köbler, Johannes, Kuhnert, Sebastian, Torán, Jacobo
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2016
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!