"Computing unsatisfiable k-SAT instances with few occurrences per variable."

Shlomo Hoory, Stefan Szeider (2005)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2005.02.004

access: open

type: Journal Article

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/HooryS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HooryS05
Shlomo Hoory, Stefan Szeider:
Computing unsatisfiable k-SAT instances with few occurrences per variable. Theor. Comput. Sci. 337(1-3): 347-359 (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.