"Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes."

Noah Fleming et al. (2022)

> Home

Details and statistics

DOI: 10.1145/3486680

access: closed

type: Journal Article

metadata version: 2022-07-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/FlemingPPR22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/FlemingPPR22
Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere:
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. J. ACM 69(3): 19:1-19:32 (2022)

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.