"Clique problem, cutting plane proofs and communication complexity."

Stasys Jukna (2012)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2012.07.003

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/Jukna12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/Jukna12
Stasys Jukna:
Clique problem, cutting plane proofs and communication complexity. Inf. Process. Lett. 112(20): 772-777 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.