Functional inversion and communication complexity
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 176553
- Communication complexity of permutation-invariant functions
- On the Communication Complexity of AND Functions
- Communication complexity of sum-type functions invariant under translation
- scientific article; zbMATH DE number 1421021
- On communication complexity of vector-valued functions
- Communication complexity of some number theoretic functions
- scientific article; zbMATH DE number 88975
- The communication complexity for decentralized evaluation of functions
- Structural analysis of the complexity of inverse functions
Cites work
- scientific article; zbMATH DE number 3990863 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Applications of a Planar Separator Theorem
- One-way permutations in NC 0
- Parallel Prefix Computation
- Planar Formulae and Their Uses
- Security, veriflability, and universality in distributed computing
- The VLSI Complexity of Sorting
- The complexity of theorem-proving procedures
Cited in
(5)- scientific article; zbMATH DE number 176209 (Why is no real title available?)
- scientific article; zbMATH DE number 176553 (Why is no real title available?)
- Structural analysis of the complexity of inverse functions
- The function-inversion problem: barriers and opportunities
- On the circuit-size of inverses
This page was built for publication: Functional inversion and communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1335026)
