"A Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using ..."

Luke Friedman (2013)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/Friedman13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/Friedman13
Luke Friedman:
A Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using Encoding Techniques. Electron. Colloquium Comput. Complex. TR13 (2013)

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.