Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Goerdt, Andreas; Pudlák, Pavel; Schöning, Uwe; Watanabe, Osamu License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-152545
URL:

; ; ;
Weitere Beteiligte (Hrsg. etc.): Andreas Goerdt and Pavel Pudlák and Uwe Schöning and Osamu Watanabe

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

pdf-format:


BibTeX - Entry

@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/opus/volltexte/2021/15254},
  URN =		{urn:nbn:de:0030-drops-152545},
  doi =		{10.4230/DagSemRep.374},
}

Seminar: Dagstuhl Seminar Reports
Issue date: 2021
Date of publication: 04.04.2003


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI