"The complexity of satisfiability problems: Refining Schaefer's theorem."

Eric Allender et al. (2009)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2008.11.001

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/AllenderBISV09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/AllenderBISV09
Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The complexity of satisfiability problems: Refining Schaefer's theorem. J. Comput. Syst. Sci. 75(4): 245-254 (2009)

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.