no code implementations • 26 Jan 2021 • SiQi Liu, Sidhanth Mohanty, Prasad Raghavendra
For instance, in a planted constraint satisfaction problem such as planted 3-SAT, the clauses are sparse observations from which the hidden assignment is to be recovered.
Community Detection Data Structures and Algorithms Probability