Login / Signup
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.
Itai Arad
Adam Bouland
Daniel Grier
Miklos Santha
Aarthi Sundaram
Shengyu Zhang
Published in:
MFCS (2016)
Keyphrases
</>
satisfiability problem
pspace complete
np complete
search algorithm
phase transition
temporal logic
solving hard
computational complexity
davis putnam
random sat
sat problem
stochastic local search
max sat
finite domain
probabilistic reasoning
stochastic local search algorithms
decision problems