On the Complexity of Random Satisfiability Problems with Planted Solutions
From MaRDI portal
Publication:2941491
DOI10.1145/2746539.2746577zbMath1321.68280arXiv1311.4821OpenAlexW2042038477MaRDI QIDQ2941491
Will Perkins, Vitaly Feldman, Santosh Vempala
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.4821
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Expander-based cryptography meets natural proofs ⋮ On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Fast Pseudorandom Functions Based on Expander Graphs ⋮ Cryptographic hardness of random local functions. Survey ⋮ Information-theoretic thresholds from the cavity method ⋮ Algebraic Attacks against Random Local Functions and Their Countermeasures ⋮ Charting the replica symmetric phase ⋮ Optimal testing for planted satisfiability problems ⋮ Unnamed Item ⋮ Expander-Based Cryptography Meets Natural Proofs ⋮ The replica symmetric phase of random constraint satisfaction problems ⋮ Unnamed Item
Uses Software
Cites Work
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Unnamed Item
