Q06 — What can constant- and logarithmic-depth STP compute?

[marwahaha]

Discussion of Q06: What can constant- and logarithmic-depth STP compute?.

For constant or logarithmic STP depth, characterize decision power and classical sampling complexity under stated restrictions on the classical controller.

Possible reductions, counterexamples, special cases, and related results are welcome. Please state the assumptions and link to relevant work.

The question page contains the full formulation and references. This conversation also appears beneath the question on both versions of the website.