Skip to main content
Theoretical Computer Science

Revival

 Revival
Answer more than 30 days after a question was asked as first answer scoring 2 or more. This badge can be awarded multiple times.

earned this badge 6 times.
$\mathsf{TC^0}$-completeness and reductions
Awarded Oct 21, 2023 at 22:05
Resource-bounded variant of Kolmogorov complexity
Awarded Oct 19, 2023 at 6:50
Is Circuit Minimization $P$-hard under logspace reductions?
Awarded Oct 5, 2023 at 3:10
Reductions and projections in circuit complexity
Awarded Sep 30, 2023 at 18:57
What circuit depth is enough to compute a log-space complete problem?
Awarded Sep 30, 2023 at 1:57
Does $NC=P$ imply the collapse of Polynomial Hierarchy?
Awarded Sep 13, 2023 at 3:32

Others with this badge