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]

Possibly Related Publications

The following publications are possibly variants of this publication: