Satisfiability threshold for random regular NAE-SAT

DOI10.1145/2591796.2591862zbMath1315.68148arXiv1310.4784OpenAlexW2072579822MaRDI QIDQ5259617

Jian Ding, Allan Sly, Nike Sun

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.4784

zbMATH Keywords

condensationconstraint satisfaction problemreplica symmetry breakingsurvey propagationsatisfiability threshold

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Phase transitions in discrete structures, The Number of Satisfying Assignments of Random Regulark-SAT Formulas, Random Instances of Problems in NP – Algorithms and Statistical Physics, Proof of the satisfiability conjecture for large \(k\), Maximum independent sets on random regular graphs, Harnessing the Bethe free energy, The asymptotic \(k\)-SAT threshold, Phase Transition for Maximum Not-All-Equal Satisfiability, Satisfiability threshold for random regular \textsc{nae-sat}, Phase Transitions in Discrete Structures, The number of solutions for random regular NAE-SAT

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography