http://openproblemgarden.org/op/complexity_of_qbf_bounded_treewidth Comments for "Complexity of QBF(Bounded Treewidth)" en http://openproblemgarden.org/op/complexity_of_qbf_bounded_treewidth <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/moshe_y_vardi">Moshe Y. Vardi</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/logic">Logic</a> » <a href="/category/finite_model_theory">Finite Model Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Question</b>&nbsp;&nbsp; What is the computational complexity of QBF(Bounded Treewidth)? Is it PSPACE-complete? In PTIME? </div> </tr></td> </table> </td> </tr> </table> Moshe Y. Vardi bounded tree width Computational Complexity FMT12-LesHouches QBF Logic Finite Model Theory http://openproblemgarden.org/op/complexity_of_qbf_bounded_treewidth#comment Fri, 18 May 2012 14:36:12 +0200 myvardi 37453 at http://openproblemgarden.org