"Satisfiability of Acyclic and Almost Acyclic CNF Formulas."

Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider (2010)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2010.84

access: open

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/OrdyniakPS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/OrdyniakPS10
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. FSTTCS 2010: 84-95

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.