"Satisfiability of acyclic and almost acyclic CNF formulas."

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

> Home

Details and statistics

DOI: 10.1016/J.TCS.2012.12.039

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/OrdyniakPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/OrdyniakPS13
Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
Satisfiability of acyclic and almost acyclic CNF formulas. Theor. Comput. Sci. 481: 85-99 (2013)

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.