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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.