scientific article
From MaRDI portal
Publication:4038696
zbMATH Open0765.68056MaRDI QIDQ4038696FDOQ4038696
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Cited In (15)
- Quantum online streaming algorithms with logarithmic memory
- On the complexity of data disjunctions.
- On the power of circuits with gates of low \(L_{1}\) norms.
- The space complexity of approximating the frequency moments
- Property testing lower bounds via a generalization of randomized parity decision trees
- Title not available (Why is that?)
- Combinatorially homomorphic encryption
- Sparse and Lopsided Set Disjointness via Information Theory
- Arithmetic sketching
- Property testing lower bounds via communication complexity
- Choosing, agreeing, and eliminating in communication complexity
- Geometric arguments yield better bounds for threshold circuits and distributed computing
- Toward computability of trace distance discord
- When distributed computation is communication expensive
- On the existence of Pareto efficient and envy-free allocations
Recommendations
- On the distributional complexity of disjointness 👍 👎
- The complexity of unions of disjoint sets 👍 👎
- The Complexity of Unions of Disjoint Sets 👍 👎
- The randomized communication complexity of set disjointness 👍 👎
- On the computational complexity of problems related to distinguishability sets 👍 👎
- On the Computational Complexity of Problems Related to Distinguishability Sets 👍 👎
- Complexity and bounds for disjunctive total bondage 👍 👎
- The complexity of dissociation set problems in graphs 👍 👎
- On the complexity of computational problems regarding distributions 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038696)
