1 paper
Dror Fried, Etay Segal, Gad E. Yaron
Toda's Theorem is a fundamental result in computational complexity theory, whose proof relies on a reduction from a QBF problem with a constant number of quantifiers to a model cou…