Multiparty communication complexity: Very hard functions

DOI10.1007/3-540-48340-3_15MaRDI QIDQ4941898zbMATH OpenFDO

Authors Ján Maňuch

Publication date 19 March 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48340-3_15

zbMATH Keywords

multiparty communication model

Mathematics Subject Classification ID

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

Recommendations

• Multiparty communication complexity and very hard functions
• 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
• The NOF multiparty communication complexity of composed functions
• The NOF multiparty communication complexity of composed functions
• Lower bounds on the multiparty communication complexity
• A separation of NP and conp in multiparty communication complexity
• Separating deterministic from randomized multiparty communication complexity

Cited in

(3)

• Languages with Bounded Multiparty Communication Complexity
• Construction of Very Hard Functions for Multiparty Communication Complexity
• Multiparty communication complexity and very hard functions

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

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