Elmar Böhler

18 papers A 1B 3Journal 13
YearRankTypeTitle / Venue / Authors
2010 J jnl
Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems
Log. Methods Comput. Sci.
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith, Henning Schnoor, Heribert Vollmer
2010 J jnl
The Complexity of Problems for Quantified Constraints.
Theory Comput. Syst.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2007 J jnl
The Complexity of Problems for Quantified Constraints.
Electron. Colloquium Comput. Complex.
Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor
2007 J jnl
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.
Theory Comput. Syst.
Elmar Böhler, Henning Schnoor
2006 J jnl
Error-bounded probabilistic computations between MA and AM.
J. Comput. Syst. Sci.
Elmar Böhler, Christian Glaßer, Daniel Meister
2005 — —
Algebraic closures in complexity theory.
Elmar Böhler
2005 J jnl
Bases for Boolean co-clones.
Inf. Process. Lett.
Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer
2005 J jnl
Generation problems.
Theor. Comput. Sci.
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2005 J jnl
On the Lattice of Clones Below the Polynomial Time Functions
Electron. Colloquium Comput. Complex.
Elmar Böhler
2005 J jnl
Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation
Electron. Colloquium Comput. Complex.
Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor, Heribert Vollmer
2004 J jnl
Generation Problems
Electron. Colloquium Comput. Complex.
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2004 B conf
Generation Problems.
MFCS
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner
2004 A conf
The Complexity of Boolean Constraint Isomorphism.
STACS
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2003 B conf
Error-Bounded Probabilistic Computations between MA and AM.
MFCS
Elmar Böhler, Christian Glaßer, Daniel Meister
2003 J jnl
Small Bounded-Error Computations and Completeness
Electron. Colloquium Comput. Complex.
Elmar Böhler, Christian Glaßer, Daniel Meister
2003 J jnl
The Complexity of Boolean Constraint Isomorphism
CoRR
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002 J jnl
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CoRR
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer
2002 B conf
Equivalence and Isomorphism for Boolean Constraint Satisfaction.
CSL
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer