The following pages link to (Q4284623):
Displaying 33 items.
- A lower bound for depth-3 circuits with MOD \(m\) gates (Q293324) (← links)
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- One-round multi-party communication complexity of distinguishing sums (Q391326) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- The communication complexity of addition (Q519955) (← links)
- A note on the power of majority gates and modular gates (Q673905) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Powering requires threshold depth 3 (Q845974) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering (Q2056927) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Upper and Lower Bounds on the Power of Advice (Q2816830) (← links)
- Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates (Q3088133) (← links)
- Interpolation by a Game (Q4224078) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- (Q4993273) (← links)
- (Q5009530) (← links)
- (Q5009542) (← links)
- (Q5009555) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- Equality alone does not simulate randomness (Q5091765) (← links)
- Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Sign rank vs discrepancy (Q5092468) (← links)
- (Q5121894) (← links)
- (Q5875514) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Improved Extractors for Recognizable and Algebraic Sources (Q5875532) (← links)
