Pages that link to "Item:Q4526965"
From MaRDI portal
The following pages link to A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction (Q4526965):
Displaying 22 items.
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- A dichotomy theorem for maximum generalized satisfiability problems. (Q960525) (← links)
- Quantifiers and approximation (Q1208413) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- The approximability of non-Boolean satisfiability problems and restricted integer programming (Q1770383) (← links)
- On the Hamming distance of constraint satisfaction problems. (Q1853512) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Independent sets with domination constraints (Q1962033) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- The approximability of constraint satisfaction problems (Q2706139) (← links)
- Complexity and approximability of quantified and stochastic constraint satisfaction problems (Q2741527) (← links)
- Complexity classification of local Hamiltonian problems (Q2799351) (← links)
- Universal Factor Graphs for Every NP-Hard Boolean CSP. (Q2969623) (← links)
- Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
- (Q4636519) (← links)
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes (Q4645742) (← links)
- Some optimal inapproximability results (Q5441360) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- The Weight in Enumeration (Q5738998) (← links)