Communication complexity and orthogonal polynomials

MaRDI QIDQ2717211zbMATH OpenFDO

Authors Ulrich Tamm

Publication date 30 September 2001

zbMATH Keywords

association schemescommunication complexityorthogonal polynomial

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Combinatorics in computer science (68R05) Application of orthogonal and other special functions (94A11)

Recommendations

• Communication complexity of sum-type functions invariant under translation
• Communication complexity in lattices
• Harmonic analysis, real approximation, and the communication complexity of Boolean functions
• Lower bounds in communication complexity
• On the communication complexity of distributed algebraic computation

Cited in

(3)

• Communication complexity of sum-type functions invariant under translation
• Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
• scientific article; zbMATH DE number 88975 (Why is no real title available?)

This page was built for publication: Communication complexity and orthogonal polynomials

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