Implications of forbidden structures for extremal algorithmic problems
Theoretical Computer Science
On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Randomized algorithms
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Complexity of Partial Satisfaction
Journal of the ACM (JACM)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Worst-case time bounds for coloring and satisfiability problems
Journal of Algorithms
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On Local Versus Global Satisfiability
SIAM Journal on Discrete Mathematics
Extremal Combinatorics: With Applications in Computer Science
Extremal Combinatorics: With Applications in Computer Science
| Hi-index | 0.00 |
An instance of a constraint satisfaction problem is l-consistent if any l constraints of it can be simultaneously satisfied. For a set Π of constraint types, ρl(Π) denotes the largest ratio of constraints which can be satisfied in any l-consistent instance composed by constraints from the set Π. We study the asymptotic behavior of ρl(Π) for sets Π consisting of Boolean predicates.