Parameterized Complexity Results in Symmetry Breaking

09/06/2010
by   Toby Walsh, et al.
0

Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into that intractability and help identify special cases in which symmetry can be dealt with more tractably

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2012

Symmetry Breaking Constraints: Recent Results

Symmetry is an important problem in many combinatorial problems. One way...
research
04/16/2019

Learning a Gauge Symmetry with Neural Networks

We explore the capacity of neural networks to detect a symmetry with com...
research
07/12/2020

Computing Floquet Hamiltonians with Symmetries

Unitary matrices arise in many ways in physics, in particular as a time ...
research
06/21/2013

Breaking Symmetry with Different Orderings

We can break symmetry by eliminating solutions within each symmetry clas...
research
05/14/2023

Diagonals-parameter symmetry model and its property for square contingency tables with ordinal categories

Previously, the diagonals-parameter symmetry model based on f-divergence...
research
08/22/2021

The Power of Random Symmetry-Breaking in Nakamoto Consensus

Nakamoto consensus underlies the security of many of the world's largest...
research
10/16/2020

Inferring symmetry in natural language

We present a methodological framework for inferring symmetry of verb pre...

Please sign up or login with your details

Forgot password? Click here to reset