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

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

doi:10.4230/DagSemRep.374

Document

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

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

Part of: Volume: Dagstuhl Seminar Reports (DagSemRep)
Part of: Series: Dagstuhl Seminar Reports (DagSemRep)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2003-04-04

PDF

File

DagSemRep.374.pdf

Filesize: 287 kB
5 pages

Document Identifiers

DOI: 10.4230/DagSemRep.374
URN: urn:nbn:de:0030-drops-152545

Author Details

Andreas Goerdt

Pavel Pudlák

Uwe Schöning

Osamu Watanabe

Cite As Get 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

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail