Pages that link to "Item:Q1777392"
From MaRDI portal
The following pages link to The complexity of Boolean constraint satisfaction local search problems (Q1777392):
Displaying 7 items.
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Approximation of Boolean functions by local search (Q1424790) (← links)
- On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment (Q1935800) (← links)
- (Q4475671) (← links)
- Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search (Q5139600) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897564) (← links)