504 search results - page 19 / 101 » The Complexity of Symmetry-Breaking Formulas |
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
COLT
1993
Springer
14 years 1 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
FCT
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in...
SIAMCOMP
2002
13 years 9 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
JAIR
2006
13 years 9 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...