504 search results - page 1 / 101 » The Complexity of Symmetry-Breaking Formulas |
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
IJCAI
2007
14 years 8 days ago
2007
JEA
2007
13 years 10 months ago
2007
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues...
IJCAI
2003
14 years 7 days ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...