On the public citation graph

Breaking All Value Symmetries in Surjection Problems

https://doi.org/10.1007/11564751_37
0 signed · 33 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11564751_36openalex-snapshot
Automatic Detection of Variable and Value Symmetries
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_28openalex-snapshot
Groups and Constraints: Symmetry Breaking during Search
inferredcites →https://doi.org/10.1007/3-540-46135-3_31openalex-snapshot
Breaking Row and Column Symmetries in Matrix Models
inferredcites →https://doi.org/10.1007/978-3-540-30210-0_17openalex-snapshot
New Developments in Symmetry Breaking in Search Using Computational Group Theory
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_23openalex-snapshot
Generic SBDD Using Computational Group Theory
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1017/cbo9780511546549openalex-snapshot
Permutation Group Algorithms
inferredcites →https://doi.org/10.1098/rspa.1986.0096openalex-snapshot
On ‘most perfect’ or ‘complete’ 8 x 8 pandiagonal magic squares
inferredcites →https://doi.org/10.1109/tc.2006.75openalex-snapshot
Efficient symmetry breaking for Boolean satisfiability
inferredcites →https://doi.org/10.1145/1066677.1066764openalex-snapshot
Breaking value symmetries in matrix models using channeling constraints

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11564751_36openalex-snapshot
Automatic Detection of Variable and Value Symmetries
inferred← citeshttps://doi.org/10.1007/11889205_33openalex-snapshot
Dynamic Lex Constraints
inferred← citeshttps://doi.org/10.1007/11889205_46openalex-snapshot
General Symmetry Breaking Constraints
inferred← citeshttps://doi.org/10.1007/11889205_48openalex-snapshot
Reasoning by Dominance in Not-Equals Binary Constraint Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-13560-1_63openalex-snapshot
Reasoning about Constraint Models
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_31openalex-snapshot
Breaking Symmetry of Interchangeable Variables and Values
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_67openalex-snapshot
Breaking Value Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_26openalex-snapshot
On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-642-17493-3_3openalex-snapshot
Parameterized Complexity Results in Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/978-3-642-21311-3_6openalex-snapshot
The AllDifferent Constraint with Precedences
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_32openalex-snapshot
Increasing Symmetry Breaking by Preserving Target Symmetries
inferred← citeshttps://doi.org/10.1007/s10601-008-9057-9openalex-snapshot
On implementing symmetry detection
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.006openalex-snapshot
Towards breaking more composition symmetries in partial symmetry breaking
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03004-0openalex-snapshot
Chapter 4 Constraint Programming
inferred← citeshttps://doi.org/10.1088/1126-6708/2009/06/075openalex-snapshot
Lifshitz topological black holes
inferred← citeshttps://doi.org/10.1109/ictai.2006.107openalex-snapshot
Solving Symmetrical CSPs with an Asymmetrical Cost Function
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8437openalex-snapshot
Symmetry Breaking Constraints: Recent Results
inferred← citeshttps://doi.org/10.26180/4546099openalex-snapshot
Automatic symmetry detection and dynamic symmetry breaking for constraint programming
inferred← citeshttps://doi.org/10.48550/arxiv.0903.0465openalex-snapshot
Breaking Value Symmetry
inferred← citeshttps://doi.org/10.48550/arxiv.0903.1136openalex-snapshot
Symmetry Breaking Using Value Precedence
inferred← citeshttps://doi.org/10.48550/arxiv.1103.3745openalex-snapshot
The AllDifferent Constraint with Precedences
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.