"On the Complexity of Random Satisfiability Problems with Planted Solutions."

Vitaly Feldman, Will Perkins, Santosh S. Vempala (2015)

Details and statistics

DOI: 10.1145/2746539.2746577

access: closed

type: Conference or Workshop Paper

metadata version: 2022-07-08

a service of  Schloss Dagstuhl - Leibniz Center for Informatics