scientific article; zbMATH DE number 7651202
From MaRDI portal
Publication:5874535
DOI10.4230/LIPIcs.ESA.2020.63MaRDI QIDQ5874535
Michał Włodarczyk, Bart M. P. Jansen
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.03443
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving MAX-\(r\)-SAT above a tight lower bound
- Best-case and worst-case sparsifiability of Boolean CSPs
- Some consequences of non-uniform conditions on uniform classes
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- A dichotomy theorem for maximum generalized satisfiability problems.
- A lower bound on the MOD 6 degree of the OR function
- Polynomials with two values
- On the degree of Boolean functions as real polynomials
- Representing Boolean functions as polynomials modulo composite numbers
- Towards a characterization of constant-factor approximable finite-valued CSPs
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT
- The Approximability of Constraint Satisfaction Problems
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- The approximability of MAX CSP with fixed-value constraints
- Preprocessing of Min Ones Problems: A Dichotomy
- Complexity of Counting CSP with Complex Weights
- Kernelization
- Approximation Algorithms for CSPs
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
- Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
This page was built for publication:
