Satisfiability Thresholds beyond k −XORSAT
From MaRDI portal
Publication:2907497
DOI10.1007/978-3-642-30642-6_15zbMath1360.68779arXiv1112.2118OpenAlexW1596849491MaRDI QIDQ2907497
Publication date: 10 September 2012
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.2118
Related Items (5)
Satisfiability Thresholds beyond k −XORSAT ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ The satisfiability threshold for random linear equations ⋮ Fast scalable construction of ([compressed static | minimal perfect hash) functions] ⋮ The rank of sparse random matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
- The SAT-UNSAT transition for random constraint satisfaction problems
- The 3-XORSAT threshold.
- Bayes networks for estimating the number of solutions of constraint networks
- On the satisfiability threshold of formulas with three literals per clause
- Satisfiability Thresholds beyond k −XORSAT
- The Decimation Process in Random k-SAT
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Modern Coding Theory
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Efficient erasure correcting codes
- Hunting for sharp thresholds
- Models for Random Constraint Satisfaction Problems
- A threshold effect for systems of random equations of a special form
- On Random Betweenness Constraints
- Cores in random hypergraphs and Boolean formulas
- Survey propagation: An algorithm for satisfiability
- Some optimal inapproximability results
- Probability and Computing
This page was built for publication: Satisfiability Thresholds beyond k −XORSAT
