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
Hilfe
Suche: Author="B{\"o}hler, Elmar"
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
The complexity of the descriptiveness of Boolean circuits over different sets of gates
Elmar Böhler
,
Henning Schnoor
Theory of Computing Systems
41
(4), 2007, pp. 753-777
Error-bounded probabilistic computations between MA and AM
Elmar Böhler
,
Christian Glaßer
,
Daniel Meister
Journal of Computer and System Sciences
72
(6), 2006, pp. 1043-1076
Bases for Boolean co-clones
Elmar Böhler
,
Steffen Reith
,
Henning Schnoor
,
Heribert Vollmer
Information Processing Letters
96
(2), 2005, pp. 59-66
Generation problems
Elmar Böhler
,
Christian Glaßer
,
Bernhard Schwarz
,
Klaus Wagner
Lecture Notes in Computer Science
3153
, 2004, pp. 392-403
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
Error-bounded probabilistic computations between MA and AM
Elmar Böhler
,
Christian Glaßer
,
Daniel Meister
Lecture Notes in Computer Science
2747
, 2003, pp. 249-258