Geometric arguments yield better bounds for threshold circuits and distributed computing
From MaRDI portal
Recommendations
Cites work
- Harmonic Analysis of Polynomial Threshold Functions
- scientific article; zbMATH DE number 4213443 (Why is no real title available?)
- scientific article; zbMATH DE number 177818 (Why is no real title available?)
- Majority gates vs. general weighted threshold gates
- On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
- Realizing Boolean functions on disjoint sets of variables
Cited in
(16)- On the power of circuits with gates of low \(L_{1}\) norms.
- A linear lower bound on the unbounded error probabilistic communication complexity.
- On relations between counting communication complexity classes
- Upper bounds on communication in terms of approximate rank
- Approximate nonnegative rank is equivalent to the smooth rectangle bound
- Threshold circuit lower bounds on cryptographic functions
- Fooling pairs in randomized communication complexity
- Norms, XOR lemmas, and lower bounds for polynomials and protocols
- Some New Classes of Geometric Threshold Schemes
- Lower bounds on threshold and related circuits via communication complexity
- scientific article; zbMATH DE number 2081103 (Why is no real title available?)
- Quantum state complexity of formal languages
- Around the log-rank conjecture
- Upper bounds on communication in terms of approximate rank
- A hierarchy of constant communication complexity
- Tight bounds for the randomized and quantum communication complexities of equality with small error
This page was built for publication: Geometric arguments yield better bounds for threshold circuits and distributed computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1365681)
