Smooth and sharp thresholds for random {k}-XOR-CNF satisfiability
RAIRO-Theor. Inf. Appl., 37 2 (2003) 127-147
Published online: 2003-11-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Entanglement Phase Transition with Spin Glass Criticality
Jeremy Côté and Stefanos KourtisPhysical Review Letters 128 (24) (2022)
https://doi.org/10.1103/PhysRevLett.128.240601
2-Xor Revisited: Satisfiability and Probabilities of Functions
Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger and Markus KubaAlgorithmica 76 (4) 1035 (2016)
https://doi.org/10.1007/s00453-016-0119-x
The Satisfiability Threshold fork-XORSAT
BORIS PITTEL and GREGORY B. SORKINCombinatorics, Probability and Computing 25 (2) 236 (2016)
https://doi.org/10.1017/S0963548315000097
LATIN 2014: Theoretical Informatics
Élie de Panafieu, Danièle Gardy, Bernhard Gittenberger and Markus KubaLecture Notes in Computer Science, LATIN 2014: Theoretical Informatics 8392 454 (2014)
https://doi.org/10.1007/978-3-642-54423-1_40
Random 2 XORSAT Phase Transition
Daudé Hervé and Ravelomanana VladyAlgorithmica 59 (1) 48 (2011)
https://doi.org/10.1007/s00453-009-9308-1
Совместность случайных систем уравнений с неравновероятной выборкой двузначных неизвестных
A V Shapovalov and А В ШаповаловМатематические вопросы криптографии 2 (4) 109 (2011)
https://doi.org/10.4213/mvk46
LATIN 2010: Theoretical Informatics
Vonjy Rasendrahasina and Vlady RavelomananaLecture Notes in Computer Science, LATIN 2010: Theoretical Informatics 6034 320 (2010)
https://doi.org/10.1007/978-3-642-12200-2_29
Automata, Languages and Programming
Martin Dietzfelbinger, Andreas Goerdt, Michael Mitzenmacher, et al.Lecture Notes in Computer Science, Automata, Languages and Programming 6198 213 (2010)
https://doi.org/10.1007/978-3-642-14165-2_19
LATIN 2008: Theoretical Informatics
Hervé Daudé and Vlady RavelomananaLecture Notes in Computer Science, LATIN 2008: Theoretical Informatics 4957 12 (2008)
https://doi.org/10.1007/978-3-540-78773-0_2
Complex Systems
R. MonassonLes Houches, Complex Systems 85 1 (2007)
https://doi.org/10.1016/S0924-8099(07)80008-4
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
John FrancoDiscrete Applied Mathematics 153 (1-3) 89 (2005)
https://doi.org/10.1016/j.dam.2005.05.008
Combinatorial sharpness criterion and phase transition classification for random CSPs
Nadia Creignou and Hervé DaudéInformation and Computation 190 (2) 220 (2004)
https://doi.org/10.1016/j.ic.2004.01.002
Random MAX SAT, random MAX CUT, and their phase transitions
Don Coppersmith, David Gamarnik, MohammadTaghi Hajiaghayi and Gregory B. SorkinRandom Structures & Algorithms 24 (4) 502 (2004)
https://doi.org/10.1002/rsa.20015
Generalized satisfiability problems: minimal elements and phase transitions
Nadia Creignou and Hervé DaudéTheoretical Computer Science 302 (1-3) 417 (2003)
https://doi.org/10.1016/S0304-3975(02)00890-3