Pages that link to "Item:Q685431"
From MaRDI portal
The following pages link to Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431):
Displaying 19 items.
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- On ACC (Q1346616) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Algebraic methods and bounded formulas (Q1377552) (← links)
- Spectral methods for matrix rigidity with applications to size-depth trade-offs and communication complexity (Q1604200) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Learning Complexity vs Communication Complexity (Q3557511) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- On closure properties of bounded two-sided error complexity classes (Q4835865) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- (Q5090936) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- On the probabilistic degree of OR over the reals (Q6074648) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
