Unexpected upper bounds on the complexity of some communication games

This publication has 14 references indexed in Scilit:

• On the power of small-depth threshold circuits
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
  Journal of Computer and System Sciences, 1992
• Rounds in communication complexity revisited
  Published by Association for Computing Machinery (ACM) ,1991
• Lower bounds to the complexity of symmetric Boolean functions
  Theoretical Computer Science, 1990
• Quasi-random graphs
  Combinatorica, 1989
• Monotone circuits for connectivity require super-logarithmic depth
  Published by Association for Computing Machinery (ACM) ,1988
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
  Graphs and Combinatorics, 1986
• Graph-theoretic arguments in low-level complexity
  Published by Springer Nature ,1977
• On Certain Sets of Integers
  Journal of the London Mathematical Society, 1953
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
  Proceedings of the National Academy of Sciences, 1946