scientific article; zbMATH DE number 4147508

MaRDI QIDQ3477957zbMATH OpenFDO

Authors U. Faigle, Gy. Turán

Publication date 1990

zbMATH Keywords

communication complexitycommunication protocollinear extensionordered setsrank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Communication complexity
• scientific article; zbMATH DE number 1361464
• scientific article; zbMATH DE number 3881884
• Communication complexity
• Communication Complexity
• On the complexity of communication complexity
• Communication Complexity
• Communication complexity hierarchy
• Probabilistic communication complexity

Cited in

(13)

• Communication complexity in lattices
• Communication complexity and linearly ordered sets
• Individual communication complexity
• Space-bounded communication complexity
• scientific article; zbMATH DE number 3909739 (Why is no real title available?)
• scientific article; zbMATH DE number 1011685 (Why is no real title available?)
• scientific article; zbMATH DE number 2134904 (Why is no real title available?)
• scientific article; zbMATH DE number 2170852 (Why is no real title available?)
• On the complexity of communication complexity
• Communication Complexity
• Communication complexity
• Automata, Languages and Programming
• The communication complexity of addition

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