On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.

Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang

Browse the full MFCS paper archive.