"Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)."

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

> Home

Details and statistics

DOI: 10.1007/978-3-642-21581-0_6

access: closed

type: Conference or Workshop Paper

metadata version: 2024-08-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sat/OrdyniakPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/OrdyniakPS11
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). SAT 2011: 47-60

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.