Black-White Pebbling is PSPACE-Complete.

Philipp Hertel Toniann Pitassi

Published in: Electron. Colloquium Comput. Complex. (2007)

Keyphrases

pspace complete
clause learning
satisfiability problem
np complete
model checking
decision problems
sat problem
strips planning
search algorithm
phase transition
temporal logic
constraint satisfaction problems
randomly generated
coalition logic
tree automata
causal graph
sat instances
computational complexity