Eugene M. Luks, Amitabha Roy  Home/Search
Context
Related
| bc.edu/~aroy/papers/amaijo...journal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: bc.edu/~aroy/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Symmetry-breaking formulas for a constraint-satisfaction problem are satisifed by exactly one member (e.g., the lexicographic leader) from each set of \symmetrical points" in the search space. Thus, the incorporation of such formulas can accelerate the search for a solution without sacrificing satisfiability. (Update)
Similar documents (at the sentence level):
34.4%: The Complexity Of Symmetry-Breaking Formulas - Luks, Roy (2004) (Correct)
25.0%: Symmetry Breaking in Constraint Satisfaction - Luks, Roy (2001) (Correct)
7.5%: Symmetry Breaking And Fault Tolerance In Boolean Satisfiability - Roy (2001) (Correct)
Active bibliography (related documents): More All
0.3: Some New 4-Designs - Eslami, Khosrovshahi, M-Noori.. (Correct)
0.2: The Role of Domain-Specific Knowledge in the Planning as.. - Kautz, Selman (1998) (Correct)
0.2: Polynomial Equation Solving by Lifting Procedures.. - Bompadre, Matera, .. (2003) (Correct)
Similar documents based on text: More All
0.5: Symmetry-Breaking Predicates for Search Problems - Crawford, Ginsberg, Luks, Roy (1996) (Correct)
0.4: Exploiting symmetry in lifted CSPs - Joslin (1997) (Correct)
0.4: Supermodels and Robustness - Ginsberg, Parkes, Roy (1998) (Correct)
BibTeX entry: (Update)
@misc{ luks-complexity,
author = "Eugene M. Luks and Amitabha Roy",
title = "The Complexity of Symmetry-Breaking Formulas",
url = "citeseer.ist.psu.edu/article/luks02complexity.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPcom.. (context) - Garey, Johnson - 1979
68 Modern Computer Algebra (context) - Gathen, Gerhard - 1999
54 Symmetry breaking predicates for search problems - Crawford, Ginsberg et al. - 1996
40 Permutation groups (context) - Dixon, Mortimer - 1996
26 Canonical labeling of graphs (context) - Babai, Luks - 1983
22 The graph isomorphism problem: its structural complexity (context) - obler, Sch et al. - 1993
18 Study of symmetry in constraint satisfaction problems - Benhamou - 1994
13 Permutation groups and polynomial-time computation (context) - Luks - 1993
12 Chelsea Publishing Company (context) - Hall, of - 1976
8 volume 65 of Encyclopedia of Mathematics and its Application.. (context) - Engel - 1997
6 Introduction to the Theory of Numbers (context) - Shapiro - 1983
6 A theoretical analysis of reasoning by symmetry in rst-order.. (context) - Crawford - 1992
5 Exploring the Power of Computing (context) - Savage, Computation - 1998
4 Exploiting symmetries in lifted csps (context) - Joslin, Roy - 1997
3 The non-existence of nite projective planes of order (context) - Lam, Thiel et al. - 1989
Documents on the same site (http://www.cs.bc.edu/~aroy/): More
Fault Tolerant Boolean Satisfiability - Luks, Roy (Correct)
Symmetry Breaking in Constraint Satisfaction - Luks, Roy (2001) (Correct)
Symmetry-Breaking Predicates for Search Problems - Crawford, Ginsberg, Luks, Roy (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC