Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC

Authors:
Mario Szegedy
Affiliations:
-
Venue:
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Year:
1993

Algebraic Characterizations of Small Classes of Boolean Functions

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Communication Complexity of the Universal Relation

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Languages with bounded multiparty communication complexity

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Hi-index	0.00