Applications
Applications
Circuit Complexity:
Constant depth in depth 3 threshold.
ACC in depth 2 with symmetric top gate.
Polynomial-time hierarchy “probabilistically low” for #P.
Still open:
Is PSPACE Turing reducible to #P?
Previous slide
Next slide
Back to the first slide
View Graphic Version