The 3-XORSAT threshold.
From MaRDI portal
Publication:1565907
DOI10.1016/S1631-073X(02)02563-3zbMath1038.68052OpenAlexW2126120616MaRDI QIDQ1565907
Jacques Mandler, Olivier Dubois
Publication date: 27 May 2003
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1631-073x(02)02563-3
Related Items (max. 100)
Many hard examples in exact phase transitions ⋮ Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ Satisfiability Thresholds beyond k −XORSAT ⋮ Combinatorial sharpness criterion and phase transition classification for random CSPs ⋮ An efficient approach to solving random \(k\)-SAT problems ⋮ Upper-bounding the \(k\)-colorability threshold by counting covers ⋮ The scaling window of the model \(d\)-\(k\)-CSP ⋮ Lower bounds on the chromatic number of random graphs ⋮ The number of satisfying assignments of random 2‐SAT formulas ⋮ One-step replica symmetry breaking of random regular NAE-SAT. II ⋮ Random 2 XORSAT phase transition ⋮ The asymptotic \(k\)-SAT threshold ⋮ The Satisfiability Threshold fork-XORSAT ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Random subcubes as a toy model for constraint satisfaction problems ⋮ Pairs of SAT-assignments in random Boolean formulæ ⋮ The satisfiability threshold for random linear equations ⋮ Unnamed Item ⋮ A case study in programming a quantum annealer for hard operational planning problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Sharp thresholds for constraint satisfaction problems and homomorphisms ⋮ Minors of a random binary matroid ⋮ Geometrical organization of solutions to random linear Boolean equations ⋮ The set of solutions of random XORSAT formulae ⋮ On the uniformity of the approximation for $r$-associated Stirling numbers of the second Kind ⋮ Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT ⋮ The condensation transition in random hypergraph 2-coloring ⋮ The replica symmetric phase of random constraint satisfaction problems ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ Random MAX SAT, random MAX CUT, and their phase transitions ⋮ When does the giant component bring unsatisfiability? ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
This page was built for publication: The 3-XORSAT threshold.
