Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

37

CORR
2010
Springer

favoriteEmaildiscussreport

96views Education» more CORR 2010»

Parameterized Complexity Results in Symmetry Breaking

13 years 9 months ago

Parameterized Complexity Results in Symmetry Breaking

Download www.cse.unsw.edu.au

Abstract. 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.

Toby Walsh

Real-time Traffic

Combinatorial Problems | Computationally Intractable | CORR 2010 | Education | Symmetry |

claim paper

Related Content

» The Parameterized Complexity of Global Constraints

» Bit complexity of breaking and achieving symmetry in chains and rings

» A new technique for distributed symmetry breaking

» Limits and Applications of Group Algebras for Parameterized Problems

» Complex 3D Shape Recovery Using a DualSpace Approach

» Jet subdivision schemes on the kregular complex

» Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise

» Fast Convergence in SelfStabilizing Wireless Networks

» Weak graph colorings distributed algorithms and applications

Post Info
More Details (n/a)

Added	24 Jan 2011
Updated	24 Jan 2011
Type	Journal
Year	2010
Where	CORR
Authors	Toby Walsh

Comments (0)