The following pages link to On ACC (Q1346616):
Displaying 45 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
- A new characterization of \(\text{ACC}^{0}\) and probabilistic \(\text{CC}^{0}\) (Q626674) (← links)
- On learning embedded midbit functions (Q817826) (← links)
- Entropy of operators or why matrix multiplication is hard for depth-two circuits (Q970107) (← links)
- Threshold circuits of small majority-depth (Q1273878) (← links)
- When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one (Q1346613) (← links)
- Perceptrons, PP, and the polynomial hierarchy (Q1346615) (← links)
- Upper and lower bounds for some depth-3 circuit classes (Q1377575) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- Local reduction (Q1641001) (← links)
- Efficient threshold circuits for power series (Q1854292) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- Dual VP classes (Q2410687) (← links)
- Optimal collapsing protocol for multiparty pointer jumping (Q2441545) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- Natural proofs versus derandomization (Q2805512) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (Q3010398) (← links)
- Nonuniform ACC Circuit Lower Bounds (Q3189637) (← links)
- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates (Q3392947) (← links)
- Local Reductions (Q3448833) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
- An Algebraic Perspective on Boolean Function Learning (Q3648753) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- New algorithms and lower bounds for circuits with linear threshold gates (Q4612481) (← links)
- Depth Reduction for Composites (Q4634033) (← links)
- Simultaneous multiparty communication protocols for composed functions (Q5005112) (← links)
- (Q5005182) (← links)
- (Q5009555) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- (Q5028429) (← links)
- (Q5121894) (← links)
- Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843) (← links)
- Degree lower bounds of tower-type for approximating formulas with parity quantifiers (Q5410333) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- Communication and information complexity (Q6200329) (← links)
- Complexity of modular circuits (Q6649462) (← links)
