scientific article; zbMATH DE number 524134
From MaRDI portal
Publication:4284623
zbMath0790.94028MaRDI QIDQ4284623
Publication date: 24 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A lower bound for depth-3 circuits with MOD \(m\) gates, Hellinger volume and number-on-the-forehead communication complexity, Powering requires threshold depth 3, Approximate Degree in Classical and Quantum Computing, Randomized feasible interpolation and monotone circuits with a local oracle, One-round multi-party communication complexity of distinguishing sums, On the power of circuits with gates of low \(L_{1}\) norms., Unnamed Item, The communication complexity of functions with large outputs, Unnamed Item, The unbounded-error communication complexity of symmetric functions, Unnamed Item, Unnamed Item, Unnamed Item, Improved Extractors for Recognizable and Algebraic Sources, String Matching: Communication, Circuits, and Learning., The NOF multiparty communication complexity of composed functions, A note on the power of majority gates and modular gates, On the computation of Boolean functions by analog circuits of bounded fan-in, Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity, The communication complexity of addition, Lower bounds for predecessor searching in the cell probe model, Polynomial threshold functions and Boolean threshold circuits, Upper and Lower Bounds on the Power of Advice, Correlation Bounds for Poly-size $\mbox{\rm AC}^0$ Circuits with n 1 − o(1) Symmetric Gates, Unnamed Item, A distributed algorithm for spectral sparsification of graphs with applications to data clustering, On data structures and asymmetric communication complexity, Equality alone does not simulate randomness, Sign rank vs discrepancy, Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity, Algorithms and lower bounds for de morgan formulas of low-communication leaf gates, Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits, Interpolation by a Game
