scientific article
From MaRDI portal
zbMath0765.68056MaRDI QIDQ4038696
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Geometric arguments yield better bounds for threshold circuits and distributed computing, On the power of circuits with gates of low \(L_{1}\) norms., When distributed computation is communication expensive, Unnamed Item, Arithmetic sketching, Quantum online streaming algorithms with logarithmic memory, Property testing lower bounds via a generalization of randomized parity decision trees, Property testing lower bounds via communication complexity, On the existence of Pareto efficient and envy-free allocations, Choosing, agreeing, and eliminating in communication complexity, The space complexity of approximating the frequency moments
