Clique Problem, Cutting Plane Proofs, and Communication Complexity

Stasys Jukna. Clique Problem, Cutting Plane Proofs, and Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC), 19:39, 2012. [doi]

Authors

Stasys Jukna

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