"Connecting SAT Algorithms and Complexity Lower Bounds."

Ryan Williams (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-21581-0_1

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sat/Williams11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/Williams11
Ryan Williams:
Connecting SAT Algorithms and Complexity Lower Bounds. SAT 2011: 1-2

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.