504 search results - page 15 / 101 » The Complexity of Symmetry-Breaking Formulas |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
ECCC
2002
14 years 9 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
ICDT
2010
ACM
15 years 2 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
107
click to vote
DAM
1999
14 years 9 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...