Multiparty communication complexity and very hard functions

DOI10.1016/J.IC.2004.03.002zbMATH Open1087.68036OpenAlexW2157201449MaRDI QIDQ598239FDOQ598239

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Partition arguments in multiparty communication complexity
• Construction of Very Hard Functions for Multiparty Communication Complexity
• The complexity of multiparty PSM protocols and related models
• Title not available (Why is that?)
• Advances in Cryptology - EUROCRYPT 2004
• Languages with Bounded Multiparty Communication Complexity
• Partition Arguments in Multiparty Communication Complexity

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)