scientific article; zbMATH DE number 894723

MaRDI QIDQ4882998zbMATH OpenFDO

Authors U. Faigle, Walter Kern, Boris Spieker

Publication date 9 October 1996

zbMATH Keywords

partially ordered setcommunication complexitygeneralized Boolean algebras\(t\)-intersection problem

Mathematics Subject Classification ID

Information theory (general) (94A15) 2-person games (91A05)

Recommendations

• Beyond set disjointness
• The communication complexity of the inevitable intersection problem
• The Probabilistic Communication Complexity of Set Intersection
• The communication complexity of set intersection and multiple equality testing
• The communication complexity of set intersection and multiple equality testing
• Deterministic communication complexity of set intersection
• scientific article; zbMATH DE number 1223708
• On Toda’s Theorem in Structural Communication Complexity
• Nondeterministic and randomized Boolean hierarchies in communication complexity
• Nondeterministic communication complexity of random Boolean functions (extended abstract)

Cited in

(1)

• On the P versus NP intersected with co-NP question in 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 Q4882998)