login/create account
Durer's Conjecture ★★★
Conjecture Every convex polytope has a non-overlapping edge unfolding.
Convex uniform 5-polytopes ★★
Author(s):
Problem Enumerate all convex uniform 5-polytopes.
Keywords:
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
Drupal
CSI of Charles University