scientific article; zbMATH DE number 1775457

zbMATH Open1052.68623MaRDI QIDQ4542591FDOQ4542591

Authors: László Babai, Thomas P. Hayes, Peter G. Kimmel 

Publication date: 1998

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

Recommendations

• The cost of the missing bit: Communication complexity with help
• Lower bounds on communication complexity
• scientific article; zbMATH DE number 1361464
• Some bounds on multiparty communication complexity of pointer jumping
• Nondeterministic communication complexity with help and graph functions

zbMATH Keywords

multiparty communication model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (7)

• The cost of the missing bit: Communication complexity with help
• Multi-color discrepancies
• Approximation of boolean functions by combinatorial rectangles
• The value of help bits in randomized and average-case complexity
• On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
• Nondeterministic communication complexity with help and graph functions
• Hadamard tensors and lower bounds on multiparty communication complexity

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 Q4542591)