"A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem."

Massimo Lauria (2016)

> Home

Details and statistics

DOI: 10.1145/2903266

access: closed

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toct/Lauria16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/Lauria16
Massimo Lauria:
A Rank Lower Bound for Cutting Planes Proofs of Ramsey's Theorem. ACM Trans. Comput. Theory 8(4): 17:1-17:13 (2016)

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.