Home » Author index

Moshe Y. Vardi


Logic » Finite Model Theory

Complexity of QBF(Bounded Treewidth) ★★

Author(s): Moshe Y. Vardi

Question   What is the computational complexity of QBF(Bounded Treewidth)? Is it PSPACE-complete? In PTIME?

Keywords: bounded tree width; Computational Complexity; FMT12-LesHouches; QBF

Posted by myvardi
updated May 18th, 2012
add new comment
Syndicate content