ask others

Journal on Satisfiability, Boolean Modeling and Computation, Volume 10

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

Volume 10, 2016

Proof Complexity

- view
  - electronic edition @ satassociation.org
- export record
  dblp key:
  - journals/jsat/Janota16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jsat/Janota16
Mikolas Janota:
On Exponential Lower Bounds for Partially Ordered Resolution. 1-9

Articles

- view
  - electronic edition @ satassociation.org
- export record
  dblp key:
  - journals/jsat/ArunachalamK16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jsat/ArunachalamK16
Srinivasan Arunachalam, Ilias Kotsireas:
Hard satisfiable 3-SAT instances via autocorrelation. 11-22

Proof Complexity

- view
  - electronic edition @ satassociation.org
- export record
  dblp key:
  - journals/jsat/BussJ16
- ask others
- share record
  short URL:
  - https://dblp.org/rec/journals/jsat/BussJ16
Sam Buss, Jan Johannsen:
On Linear Resolution. 23-35

maintained by

, founded at