Clique Problem, Cutting Plane Proofs, and Communication Complexity - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

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

@article{Jukna12-0,
  title = {Clique Problem, Cutting Plane Proofs, and Communication Complexity},
  author = {Stasys Jukna},
  year = {2012},
  url = {http://eccc.hpi-web.de/report/2012/039},
  researchr = {https://researchr.org/publication/Jukna12-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {19},
  pages = {39},
}

runs on WebDSL