Multiparty communication complexity and very hard functions

DOI10.1016/J.IC.2004.03.002MaRDI QIDQ598239zbMATHOpenAlexFDO

Authors Pavol Ďuriš

Publication date 6 August 2004

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2004.03.002

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1418336
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Multiparty communication complexity of vector-valued and sum-type functions
• scientific article; zbMATH DE number 1688365
• A separation of NP and conp in multiparty communication complexity
• Lower bounds on the multiparty communication complexity
• Advances in Cryptology - EUROCRYPT 2004
• The NOF multiparty communication complexity of composed functions
• The NOF multiparty communication complexity of composed functions

Cites work

• Communication Complexity
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Lower bounds on communication complexity
• Optimal lower bounds on the multiparty communication complexity

Cited in

(10)

• scientific article; zbMATH DE number 1419257 (Why is no real title available?)
• scientific article; zbMATH DE number 1418336 (Why is no real title available?)
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Advances in Cryptology - EUROCRYPT 2004
• Partition arguments in multiparty communication complexity
• The complexity of multiparty PSM protocols and related models
• Partition Arguments in Multiparty Communication Complexity
• Languages with Bounded Multiparty Communication Complexity
• Nondeterministic communication complexity of random Boolean functions (extended abstract)
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)

This page was built for publication: Multiparty communication complexity and very hard functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598239)