"Strong partial clones and the time complexity of SAT problems."

Peter Jonsson et al. (2017)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2016.07.008

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/JonssonLNZ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/JonssonLNZ17
Peter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini:
Strong partial clones and the time complexity of SAT problems. J. Comput. Syst. Sci. 84: 52-78 (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.