A simple lower bound for monotone clique using a communication game

This publication has 5 references indexed in Scilit:

• Probabilistic communication complexity of Boolean relations
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
  Mathematical Notes, 1987
• The monotone circuit complexity of boolean functions
  Combinatorica, 1987
• Parity, circuits, and the polynomial-time hierarchy
  Theory of Computing Systems, 1984
• ∑11-Formulae on finite structures
  Annals of Pure and Applied Logic, 1983