default search action

combined dblp search
author search
venue search
publication search

ask others

Journal on Satisfiability, Boolean Modeling and Computation, Volume 15

> Home > Journals > Journal on Satisfiability, Boolean Modeling and Computation

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 15, Number 1, 2024

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jsat/Nadel24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/Nadel24
Alexander Nadel:
TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver. 1-7
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jsat/BeyersdorffCDM24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/BeyersdorffCDM24
Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin:
The Riis Complexity Gap for QBF Resolution. 9-25
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/jsat/BeyersdorffHS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/BeyersdorffHS24
Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann:
Proof Complexity of Propositional Model Counting. 27-59

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.