Proceedings

Front Cover
Computer Society Press of the IEEE, 1991 - Computational complexity

From inside the book

Contents

Counting Classes Are at Least as Hard as the PolynomialTime Hierarchy
2
PP Is Closed under TruthTable Reductions
12
GapDefinable Counting Classes
28
Copyright

31 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information