Pages that link to "Item:Q1575713"
From MaRDI portal
The following pages link to Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713):
Displaying 13 items.
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Supermodular functions and the complexity of MAX CSP (Q2387428) (← links)
- Universal qudit Hamiltonians (Q2662847) (← links)
- Complexity classification of local Hamiltonian problems (Q2799351) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Weighted NP Optimization Problems: Logical Definability and Approximation Properties (Q4210135) (← links)
- (Q4636519) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- (Q5111359) (← links)
- (Q5457277) (← links)
- Introduction to the Maximum Solution Problem (Q5504706) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900295) (← links)