Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Stasys Jukna. Clique Problem, Cutting Plane Proofs, and Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC), 19:39, 2012. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Clique problem, cutting plane proofs and communication complexityStasys Jukna. ipl, 112(20):772-777, 2012. [doi]
The following publications are possibly variants of this publication: