"On the Gap between the Complexity of SAT and Minimization for Certain ..."

Ondrej Cepek, Stefan Gurský (2014)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2024-03-20

- view
  - electronic edition @ uic.edu (archived)
- export record
  dblp key:
  - conf/isaim/CepekG14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaim/CepekG14
Ondrej Cepek, Stefan Gurský:
On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. ISAIM 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.