Clique problem, cutting plane proofs and communication complexity

Stasys Jukna. Clique problem, cutting plane proofs and communication complexity. Inf. Process. Lett., 112(20):772-777, 2012. [doi]

Authors

Stasys Jukna

This author has not been identified. Look up 'Stasys Jukna' in Google