Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Reith, Steffen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of problems for quantified constraints
Michael Bauland
,
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Theory of Computing Systems
47
(2), 2010, pp. 454-490
Bases for Boolean co-clones
Elmar Böhler
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Information Processing Letters
96
(2), 2005, pp. 59-66
The complexity of Boolean constraint isomorphism
Elmar Böhler
,
Edith Hemaspaandra
,
Steffen Reith
,
Heribert Vollmer
Lecture Notes in Computer Science
2996
, 2004, pp. 164-175
Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory
Elmar Böhler
,
Nadia Creignou
,
Steffen Reith
,
Heribert Vollmer
ACM SIGACT News
34
(4), 2003, December, pp. 38-52
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Steffen Reith
,
Heribert Vollmer
Information and Computation
186
(1), 2003, pp. 1-19
On the complexity of some equivalence problems for propositional calculi
Steffen Reith
Lecture Notes in Computer Science
2747
, 2003, pp. 632-641
On Boolean lowness and Boolean highness
Steffen Reith
,
Klaus W. Wagner
Theoretical Computer Science
261
(2), 2001, pp. 305-321
The complexity of base station positioning in cellular networks
Christian Glasser
,
Steffen Reith
,
Heribert Vollmer
Proceedings in Informatics
8
, 2000, pp. 167-177
A note on closure properties of logspace MOD classes
Ulrich Hertrampf
,
Steffen Reith
,
Heribert Vollmer
Information Processing Letters
75
(3), 2000, pp. 91-93
Optimal satisfiability for propositional calculi and constraint satisfaction problems
Steffen Reith
,
Heribert Vollmer
Lecture Notes in Computer Science
1893
, 2000, pp. 640-649
On Boolean lowness and Boolean highness
Steffen Reith
,
Klaus W. Wagner
Lecture Notes in Computer Science
1449
, 1998, pp. 147-156