| 2007 |
| 15 | EE | Heribert Vollmer,
Michael Bauland,
Elmar Böhler,
Nadia Creignou,
Steffen Reith,
Henning Schnoor:
The Complexity of Problems for Quantified Constraints.
Electronic Colloquium on Computational Complexity (ECCC) 14(023): (2007) |
| 14 | EE | Elmar Böhler,
Henning Schnoor:
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.
Theory Comput. Syst. 41(4): 753-777 (2007) |
| 2006 |
| 13 | EE | Elmar Böhler,
Christian Glaßer,
Daniel Meister:
Error-bounded probabilistic computations between MA and AM.
J. Comput. Syst. Sci. 72(6): 1043-1076 (2006) |
| 2005 |
| 12 | EE | Michael Bauland,
Elmar Böhler,
Nadia Creignou,
Steffen Reith,
Henning Schnoor,
Heribert Vollmer:
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electronic Colloquium on Computational Complexity (ECCC)(024): (2005) |
| 11 | EE | Elmar Böhler:
On the Lattice of Clones Below the Polynomial Time Functions
Electronic Colloquium on Computational Complexity (ECCC)(028): (2005) |
| 10 | EE | Elmar Böhler,
Steffen Reith,
Henning Schnoor,
Heribert Vollmer:
Bases for Boolean co-clones.
Inf. Process. Lett. 96(2): 59-66 (2005) |
| 9 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation problems.
Theor. Comput. Sci. 345(2-3): 260-295 (2005) |
| 2004 |
| 8 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation Problems.
MFCS 2004: 392-403 |
| 7 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism.
STACS 2004: 164-175 |
| 6 | EE | Elmar Böhler,
Christian Glaßer,
Bernhard Schwarz,
Klaus W. Wagner:
Generation Problems
Electronic Colloquium on Computational Complexity (ECCC)(037): (2004) |
| 2003 |
| 5 | EE | Elmar Böhler,
Christian Glaßer,
Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM.
MFCS 2003: 249-258 |
| 4 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism
CoRR cs.CC/0306134: (2003) |
| 3 | EE | Elmar Böhler,
Christian Glaßer,
Daniel Meister:
Small Bounded-Error Computations and Completeness
Electronic Colloquium on Computational Complexity (ECCC)(069): (2003) |
| 2002 |
| 2 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction.
CSL 2002: 412-426 |
| 1 | EE | Elmar Böhler,
Edith Hemaspaandra,
Steffen Reith,
Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR cs.CC/0202036: (2002) |