@TechReport{goerdt_et_al:DagSemRep.374,
author = {Goerdt, Andreas and Pudl\'{a}k, Pavel and Sch\"{o}ning, Uwe and Watanabe, Osamu},
title = {{The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141)}},
pages = {1--5},
ISSN = {1619-0203},
year = {2003},
type = {Dagstuhl Seminar Report},
number = {374},
institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.374},
URN = {urn:nbn:de:0030-drops-152545},
doi = {10.4230/DagSemRep.374},
}