default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElmar Böhler
Person information
- affiliation: University of Würzburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j6]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)- [j5]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
- 2007
- [j4]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]Heribert Vollmer, Michael Bauland, Elmar Böhler, Nadia Creignou, Steffen Reith, Henning Schnoor:
The Complexity of Problems for Quantified Constraints. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j3]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]Elmar Böhler:
Algebraic closures in complexity theory. Julius Maximilians University Würzburg, Germany, 2005, pp. 1-140 - [j2]Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. Inf. Process. Lett. 96(2): 59-66 (2005) - [j1]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005) - [i6]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. TR05 (2005) - [i5]Elmar Böhler:
On the Lattice of Clones Below the Polynomial Time Functions. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c4]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation Problems. MFCS 2004: 392-403 - [c3]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - [i4]Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner:
Generation Problems. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Elmar Böhler, Christian Glaßer, Daniel Meister:
Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258 - [i3]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. CoRR cs.CC/0306134 (2003) - [i2]Elmar Böhler, Christian Glaßer, Daniel Meister:
Small Bounded-Error Computations and Completeness. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c1]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CSL 2002: 412-426 - [i1]Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
Equivalence and Isomorphism for Boolean Constraint Satisfaction. CoRR cs.CC/0202036 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
