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]

@article{Jukna12,
  title = {Clique problem, cutting plane proofs and communication complexity},
  author = {Stasys Jukna},
  year = {2012},
  doi = {10.1016/j.ipl.2012.07.003},
  url = {http://dx.doi.org/10.1016/j.ipl.2012.07.003},
  researchr = {https://researchr.org/publication/Jukna12},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {112},
  number = {20},
  pages = {772-777},
}