The following pages link to (Q4035673):
Displaying 12 items.
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- The log-rank conjecture and low degree polynomials (Q1029056) (← links)
- On sparse hard sets for counting classes (Q1210293) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- On bounded-probability operators and C\(_ =\)P (Q1313771) (← links)
- The expressive power of voting polynomials (Q1330793) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- Generalized theorems on relationships among reducibility notions to certain complexity classes (Q4298368) (← links)
- On closure properties of bounded two-sided error complexity classes (Q4835865) (← links)
- A lower bound for monotone perceptrons (Q4841765) (← links)
- Computational complexity of counting coincidences (Q6614012) (← links)
