Complexity of membership problem in finite general linear group
Posted by Pierre, at mathoverflow.net,
$\DeclareMathOperator\GL{GL}$Suppose $G$ is a subgroup of $\GL(n,q)$ given by a list of generators. What is known about the…
Randomized algorithms not based on Schwartz-Zippel
Posted by Shaull, at cstheory.stackexchange.com,
Are there any problems that are known to be in a randomized complexity class (e.g. RNC, ZPP, RP, BPP, or even PP), but not in…
Problem in BPP but not known to be in RP or co-RP
Posted by arnab, at cstheory.stackexchange.com,
Is there an example of a natural problem that's in BPP but that's not known to be in RP or co-RP?