On the Complexity of Breaking Symmetry

05/16/2020
by   Toby Walsh, et al.
16

We can break symmetry by eliminating solutions within a symmetry class that are not least in the lexicographical ordering. This is often referred to as the lex-leader method. Unfortunately, as symmetry groups can be large, the lexleader method is not tractable in general. We prove that using other total orderings besides the usual lexicographical ordering will not reduce the computational complexity of breaking symmetry in general. It follows that breaking symmetry with other orderings like the Gray code ordering or the Snake-Lex ordering is intractable in general.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2013

Breaking Symmetry with Different Orderings

We can break symmetry by eliminating solutions within each symmetry clas...
research
03/18/2021

Exploiting Isomorphic Subgraphs in SAT (Long version)

While static symmetry breaking has been explored in the SAT community fo...
research
07/13/2021

Spontaneous Symmetry Breaking for Extreme Vorticity and Strain in the 3D Navier-Stokes Equations

We investigate the spatio-temporal structure of the most likely configur...
research
04/27/2023

Exploring the flavor structure of quarks and leptons with reinforcement learning

We propose a method to explore the flavor structure of quarks and lepton...
research
01/31/2018

Lifted Filtering via Exchangeable Decomposition

We present a model for recursive Bayesian filtering based on lifted mult...
research
12/27/2010

Symmetry Breaking with Polynomial Delay

A conservative class of constraint satisfaction problems CSPs is a class...

Please sign up or login with your details

Forgot password? Click here to reset