504 search results - page 1 / 101 » The Complexity of Symmetry-Breaking Formulas |
82
Voted
AMAI
2004
Springer
15 years 19 days ago
2004
Springer
IJCAI
2007
15 years 2 months ago
2007
66
Voted
JEA
2007
15 years 19 days ago
2007
103
Voted
CORR
2010
Springer
14 years 11 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...
93
Voted
IJCAI
2003
15 years 2 months 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...