Elmar Böhler

Affiliations:

University of Würzburg, Germany

According to our database¹, Elmar Böhler authored at least 12 papers between 2002 and 2010.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2010

Boolean Circuits as a Data Structure for Boolean Functions: Efficient Algorithms and Hard Problems

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2010

2007

The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates.

[BibT_eX]

[DOI]

Elmar Böhler

Henning Schnoor

Theory Comput. Syst., 2007

The Complexity of Problems for Quantified Constraints.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

2006

Error-bounded probabilistic computations between MA and AM.

[BibT_eX]

[DOI]

Elmar Böhler

Christian Glaßer

Daniel Meister

J. Comput. Syst. Sci., 2006

2005

Algebraic closures in complexity theory.

[BibT_eX]

[DOI]

Elmar Böhler

PhD thesis, 2005

Generation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Bases for Boolean co-clones.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

On the Lattice of Clones Below the Polynomial Time Functions

[BibT_eX]

[DOI]

Elmar Böhler

Electron. Colloquium Comput. Complex., 2005

Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

2004

The Complexity of Boolean Constraint Isomorphism.

[BibT_eX]

[DOI]

Proceedings of the STACS 2004, 2004

2003

Small Bounded-Error Computations and Completeness

[BibT_eX]

[DOI]

Elmar Böhler

Christian Glaßer

Daniel Meister

Electron. Colloquium Comput. Complex., 2003

2002

Equivalence and Isomorphism for Boolean Constraint Satisfaction.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Elmar Böhler

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...