"Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable."

Shlomo Hoory, Stefan Szeider (2004)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ satisfiability.org (open access)
- export record
  dblp key:
  - conf/sat/HooryS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/HooryS04
Shlomo Hoory, Stefan Szeider:
Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. SAT 2004

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.