"Recognizing More Unsatisfiable Random k-SAT Instances Efficiently."

Joel Friedman, Andreas Goerdt, Michael Krivelevich (2005)

> Home

Details and statistics

DOI: 10.1137/S009753970444096X

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/FriedmanGK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/FriedmanGK05
Joel Friedman, Andreas Goerdt, Michael Krivelevich:
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM J. Comput. 35(2): 408-430 (2005)

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.