scientific article; zbMATH DE number 1419257

zbMATH Open0944.68116MaRDI QIDQ4942276FDOQ4942276

Authors: Jean-François Raymond, Pascal Tesson, Denis Thérien 

Publication date: 21 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1688365
• Lower bounds on the multiparty communication complexity
• The multiparty communication complexity of set disjointness
• The multiparty communication complexity of set disjointness
• Multiparty communication complexity and very hard functions
• Optimal lower bounds on the multiparty communication complexity
• Multiparty communication complexity of vector-valued and sum-type functions
• Separating deterministic from randomized multiparty communication complexity
• A separation of NP and conp in multiparty communication complexity

zbMATH Keywords

complexity of languagesYao's two-party communication game

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (2)

• Languages with Bounded Multiparty Communication Complexity
• Title not available (Why is that?)

This page was built for publication:

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