scientific article; zbMATH DE number 7561536
From MaRDI portal
Publication:5091194
DOI10.4230/LIPIcs.ICALP.2019.43MaRDI QIDQ5091194
Philipp Loick, Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
phase transitionsinformation theorysharp thresholdBayesian inferenceefficient algorithmsgroup testing problem
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic \(k\)-SAT threshold
- Group testing with random pools: Phase transitions and optimal strategy
- The 3-XORSAT threshold.
- Information-theoretic thresholds from the cavity method
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Proof of the Satisfiability Conjecture for Large k
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem
- Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework
- Group Testing Algorithms: Bounds and Simulations
- Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
- Information, Physics, and Computation
- Community Detection and Stochastic Block Models
- The Capacity of Bernoulli Nonadaptive Group Testing
- Phase Transitions in Group Testing
- Performance of Group Testing Algorithms With Near-Constant Tests Per Item
- The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
- An Efficient Algorithm for Combinatorial Group Testing
- The Computer Science and Physics of Community Detection: Landscapes, Phase Transitions, and Hardness
- Individual Testing Is Optimal for Nonadaptive Group Testing in the Linear Regime
- The freezing threshold for k-colourings of a random graph
- Statistical algorithms and a lower bound for detecting planted cliques
- On the solution‐space geometry of random constraint satisfaction problems
This page was built for publication:
