Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Elmar Böhler

2010 – today

see FAQ

What is the meaning of the colors in the publication list?

2010
[j6]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/abs-1009-1208
- ask others
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. Logical Methods in Computer Science 8(3) (2010)
[j5]
- view
  - electronic edition @ metapress.com
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mst/BaulandBCRSV10
- ask others
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): 454-490 (2010)

2000 – 2009

see FAQ

What is the meaning of the colors in the publication list?

2007
[j4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/mst/BohlerS07
- ask others
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)
[i7]
- view
  - electronic edition @ hpi-web.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eccc/VollmerBBCRS07
- ask others
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)
2006
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jcss/BohlerGM06
- ask others
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
[b1]
- view
  - electronic edition @ uni-wuerzburg.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - phd/de/Bohler2005
- ask others
Elmar Böhler: Algebraic closures in complexity theory. Julius Maximilian University of Würzburg 2005, pp. 1-140
[j2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/BohlerRSV05
- ask others
Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer: Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005)
[j1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/BohlerGSW05
- ask others
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005)
[i6]
- view
  - electronic edition @ hpi-web.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eccc/ECCC-TR05-024
- ask others
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)
[i5]
- view
  - electronic edition @ hpi-web.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eccc/ECCC-TR05-028
- ask others
Elmar Böhler: On the Lattice of Clones Below the Polynomial Time Functions. Electronic Colloquium on Computational Complexity (ECCC)(028) (2005)
2004
[c4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/mfcs/BohlerGSW04
- ask others
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems. MFCS 2004: 392-403
[c3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/stacs/BohlerHRV04
- ask others
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175
[i4]
- view
  - electronic edition @ hpi-web.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eccc/ECCC-TR04-037
- ask others
Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems. Electronic Colloquium on Computational Complexity (ECCC)(037) (2004)
2003
[c2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/mfcs/BohlerGM03
- ask others
Elmar Böhler, Christian Glaßer, Daniel Meister: Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258
[i3]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/cs-CC-0306134
- ask others
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003)
[i2]
- view
  - electronic edition @ hpi-web.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/eccc/ECCC-TR03-069
- ask others
Elmar Böhler, Christian Glaßer, Daniel Meister: Small Bounded-Error Computations and Completeness. Electronic Colloquium on Computational Complexity (ECCC)(069) (2003)
2002
[c1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/csl/BohlerHRV02
- ask others
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426
[i1]
- view
  - electronic edition @ arxiv.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/corr/cs-CC-0202036
- ask others
Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer: Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002)