Elmar Böhler

Publication Activity (10 Years)

Years Active: 2002-2010
Publications (10 Years): 0

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
The Complexity of Problems for Quantified Constraints. Theory Comput. Syst. 47 (2) (2010)
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems Log. Methods Comput. Sci. 8 (3) (2010)
Elmar Böhler, Henning Schnoor
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates. Theory Comput. Syst. 41 (4) (2007)
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. 14 (023) (2007)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72 (6) (2006)
Elmar Böhler
On the Lattice of Clones Below the Polynomial Time Functions Electron. Colloquium Comput. Complex. (028) (2005)
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation Electron. Colloquium Comput. Complex. (024) (2005)
Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
Bases for Boolean co-clones. Inf. Process. Lett. 96 (2) (2005)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation problems. Theor. Comput. Sci. 345 (2-3) (2005)
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
The Complexity of Boolean Constraint Isomorphism. STACS (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems. MFCS (2004)
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
Generation Problems Electron. Colloquium Comput. Complex. (037) (2004)
Elmar Böhler, Christian Glaßer, Daniel Meister
Small Bounded-Error Computations and Completeness Electron. Colloquium Comput. Complex. (069) (2003)
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
The Complexity of Boolean Constraint Isomorphism CoRR (2003)
Elmar Böhler, Christian Glaßer, Daniel Meister
Error-Bounded Probabilistic Computations between MA and AM. MFCS (2003)
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL (2002)
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
Equivalence and Isomorphism for Boolean Constraint Satisfaction CoRR (2002)

Elmar Böhler.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Elmar Böhler