"Certifying Unsatisfiability of Random 2k-SAT Formulas Using ..."

Amin Coja-Oghlan et al. (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-45077-1_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fct/Coja-OghlanGLS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fct/Coja-OghlanGLS03
Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich:
Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques. FCT 2003: 15-26

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.