"A Computational Trichotomy for Connectivity of Boolean Satisfiability."

Konrad W. Schwerdtfeger (2014)

> Home

Details and statistics

DOI: 10.3233/SAT190097

access: open

type: Journal Article

metadata version: 2020-08-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsat/Schwerdtfeger14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/Schwerdtfeger14
Konrad W. Schwerdtfeger:
A Computational Trichotomy for Connectivity of Boolean Satisfiability. J. Satisf. Boolean Model. Comput. 8(3/4): 173-195 (2014)

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.