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
MSO alternation hierarchy over pictures ★★
Author(s): Grandjean
Question Is the MSO-alternation hierarchy strict for pictures that are balanced, in the sense that the width and the length are polynomially (or linearly) related.
Keywords: FMT12-LesHouches; MSO, alternation hierarchy; picture languages