scientific article; zbMATH DE number 7053314
From MaRDI portal
Publication:5743435
zbMath1423.68211MaRDI QIDQ5743435
Morteza Ibrahimi, Yashodhan Kanoria, Matt Kraning, Andrea Montanari
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095178
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite size scaling for the core of large random hypergraphs
- Gibbs measures and phase transitions on sparse random graphs
- The asymptotic distribution of short cycles in random regular graphs
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- The 3-XORSAT threshold.
- Two solutions to diluted \(p\)-spin models and XORSAT problems
- Processes on unimodular random networks
- Modern Coding Theory
- Expander graphs and their applications
- Factorization of a 768-Bit RSA Modulus
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Information, Physics, and Computation
- Sharp thresholds of graph properties, and the $k$-sat problem
- Efficient erasure correcting codes
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- Cores in random hypergraphs and Boolean formulas
- Determining computational complexity from characteristic ‘phase transitions’
- Gibbs states and the set of solutions of random constraint satisfaction problems
- A Better Algorithm for Random k-SAT
- On the solution‐space geometry of random constraint satisfaction problems
