Fractional Covers and Communication Complexity

This publication has 8 references indexed in Scilit:

• A simple lower bound for monotone clique using a communication game
  Information Processing Letters, 1992
• Private vs. common random bits in communication complexity
  Information Processing Letters, 1991
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
  SIAM Journal on Discrete Mathematics, 1990
• The Complexity of Finite Functions
  Published by Elsevier ,1990
• Communication Complexity
  Published by MIT Press ,1989
• A Greedy Heuristic for the Set-Covering Problem
  Mathematics of Operations Research, 1979
• On the ratio of optimal integral and fractional covers
  Discrete Mathematics, 1975
• Method of determining lower bounds for the complexity of P-schemes
  Mathematical Notes, 1971