scientific article; zbMATH DE number 1775457

MaRDI QIDQ4542591zbMATH OpenFDO

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

Publication date 1998

zbMATH Keywords

multiparty communication model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

Cited in

(8)

• Approximation of boolean functions by combinatorial rectangles
• On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
• The value of help bits in randomized and average-case complexity
• Nondeterministic communication complexity with help and graph functions
• Multi-color discrepancies
• Hadamard tensors and lower bounds on multiparty communication complexity
• scientific article; zbMATH DE number 1361464 (Why is no real title available?)
• The cost of the missing bit: Communication complexity with help

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)