2022
DOI: 10.48550/arxiv.2208.02732
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Almost Consistent Systems of Linear Equations

Abstract: Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied equations. This problem is NP-hard and UGC-hard to approximate within any constant even for two-variable equations over the twoelement field. We study this problem from the point of view of parameterized complexity, with the parameter being the number of unsatisfied equations. We con… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 26 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?