Complexity of QBF(Bounded Treewidth) (Solved)
Question What is the computational complexity of QBF(Bounded Treewidth)? Is it PSPACE-complete? In PTIME?
 G. Pan, M. Y. Vardi, Fixed-Parameter Hierarchies inside PSPACE, LICS 2006, pp.27-36, 21st Annual IEEE Symposium on Logic in Computer Science, 2006.
* indicates original appearance(s) of problem.