Change search
ReferencesLink to record
Permanent link

Direct link
Satisfying Degree-d Equations of GF(2)n
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0002-5379-345X
2011 (English)In: APPROX 2011, Vol. 6845, 242-253 p.Article in journal (Refereed) Published
Abstract [en]

We study the problem where we are given a system of polynomial equations defined by multivariate polynomials over GF[2] of fixed constant degree d > 1 and the aim is to satisfy the maximal number of equations. A random assignment approximates this problem within a factor 2−d and we prove that for any ε > 0, it is NP-hard to obtain a ratio 2−d+ε. When considering instances that are perfectly satisfiable we give a probabilistic polynomial time algorithm that, with high probability, satisfies a fraction 21−d − 21−2d and we prove that it is NP-hard to do better by an arbitrarily small constant. The hardness results are proved in the form of inapproximability results of Max-CSPs where the predicate in question has the desired form and we give some immediate results on approximation resistance of some predicates.

Place, publisher, year, edition, pages
2011. Vol. 6845, 242-253 p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-81032OAI: diva2:497029
QC 20120210Available from: 2012-02-10 Created: 2012-02-10 Last updated: 2012-02-10Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Håstad, Johan
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 29 hits
ReferencesLink to record
Permanent link

Direct link