"The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and ..."

Konrad W. Schwerdtfeger (2017)

> Home

Details and statistics

DOI: 10.1007/S00224-015-9663-Z

access: closed

type: Journal Article

metadata version: 2017-07-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Schwerdtfeger17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Schwerdtfeger17
Konrad W. Schwerdtfeger:
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits. Theory Comput. Syst. 61(2): 263-282 (2017)

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.