504 search results - page 33 / 101 » The Complexity of Symmetry-Breaking Formulas |
DCG
2010
13 years 7 months ago
2010
We show that any family of sets uniformly definable in an ominimal structure has an extended compression scheme of size equal to the number of parameters in the defining formula. ...
EJC
2006
13 years 10 months ago
2006
We study the positive Bergman complex B+ (M) of an oriented matroid M, which is a certain subcomplex of the Bergman complex B(M) of the underlying unoriented matroid M. The positiv...
CORR
2009
Springer
13 years 7 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
ATAL
2006
Springer
14 years 1 months ago
2006
Springer
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
STACS
2000
Springer
14 years 1 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...