"On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas."

Paul Beame et al. (1998)

> Home

Details and statistics

DOI: 10.1145/276698.276870

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/BeameKPS98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/BeameKPS98
Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks:
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. STOC 1998: 561-571

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.