Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average

DOI10.1007/978-3-642-13731-0_17zbMath1285.68062OpenAlexW1935571425MaRDI QIDQ3569888

No author found.

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (16)

Improved Parameterized Algorithms for above Average Constraint Satisfaction ⋮ Kernelization – Preprocessing with a Guarantee ⋮ Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey ⋮ Satisfying more than half of a system of linear equations over GF(2): a multivariate approach ⋮ Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) ⋮ Note on maximal bisection above tight lower bound ⋮ Parameterized complexity of MaxSat above average ⋮ A new bound for 3-satisfiable MaxSat and its algorithmic application ⋮ Unnamed Item ⋮ Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables ⋮ A probabilistic approach to problems parameterized above or below tight bounds ⋮ Solving MAX-\(r\)-SAT above a tight lower bound ⋮ Betweenness parameterized above tight lower bound ⋮ Confronting intractability via parameters ⋮ Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width ⋮ A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

This page was built for publication: Systems of Linear Equations over $\mathbb{F}_2$ and Problems Parameterized above Average