Combinatorial sharpness criterion and phase transition classification for random CSPs
Information and Computation
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Random Structures & Algorithms
Many hard examples in exact phase transitions
Theoretical Computer Science
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Pairs of SAT-assignments in random Boolean formulæ
Theoretical Computer Science
Phase transition for random quantified XOR-formulas
Journal of Artificial Intelligence Research
Low-density graph codes that are optimal for binning and coding with side information
IEEE Transactions on Information Theory
Random 2-XORSAT at the satisfiability threshold
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Lossy source compression using low-density generator matrix codes: analysis and algorithms
IEEE Transactions on Information Theory
On the phase transitions of random k-constraint satisfaction problems
Artificial Intelligence
The condensation transition in random hypergraph 2-coloring
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The MAX-CUT of sparse random graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The set of solutions of random XORSAT formulae
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Limit theorems for random MAX-2-XORSAT
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Catching the k-NAESAT threshold
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The freezing threshold for k-colourings of a random graph
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Going after the k-SAT threshold
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.12 |
We prove the existence of the 3-XORSAT threshold, establishing its value as a function of the root of a transcendental equation.