The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141)

Authors Andreas Goerdt, Pavel Pudlák, Uwe Schöning, Osamu Watanabe



PDF
Thumbnail PDF

File

DagSemRep.374.pdf
  • Filesize: 287 kB
  • 5 pages

Document Identifiers

Author Details

Andreas Goerdt
Pavel Pudlák
Uwe Schöning
Osamu Watanabe

Cite AsGet BibTex

Andreas Goerdt, Pavel Pudlák, Uwe Schöning, and Osamu Watanabe. The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141). Dagstuhl Seminar Report 374, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
https://doi.org/10.4230/DagSemRep.374

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads