default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristian Herrmann 0003
Person information
- affiliation: TU Darmstadt, Germany
- affiliation: KAIST, South Korea
Other persons with the same name
- Christian Herrmann — disambiguation page
- Christian Herrmann 0001 — Karlsruhe Institute of Technology KIT, Vision and Fusion Lab, Germany (and 1 more)
- Christian Herrmann 0002 — University of Würzburg, Department of Robotics and Telematics, Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j8]Christian Herrmann, Yasuyuki Tsukamoto, Martin Ziegler:
On the consistency problem for modular lattices and related structures. Int. J. Algebra Comput. 26(8): 1573-1595 (2016)- [j7]Christian Herrmann, Martin Ziegler:
Computational Complexity of Quantum Satisfiability. J. ACM 63(2): 19:1-19:31 (2016) - [j6]Christian Herrmann:
Homogeneous Modular Lattices are Distributive. Order 33(2): 359-363 (2016) - 2013
- [c2]Christian Herrmann, Johanna Sokoli, Martin Ziegler:
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. MCU 2013: 85-92 - 2011
- [c1]Christian Herrmann, Martin Ziegler:
Computational Complexity of Quantum Satisfiability. LICS 2011: 175-184 - 2010
- [j5]Christian Herrmann:
On the equational theory of projection lattices of finite von Neumann factors. J. Symb. Log. 75(3): 1102-1110 (2010) - [i1]Christian Herrmann, Martin Ziegler:
Expressiveness and Computational Complexity of Geometric Quantum Logic. CoRR abs/1004.1696 (2010)
2000 – 2009
- 2006
- [j4]Christian Herrmann:
Corrigendum to "On the undecidability of implications between embedded multivalued database dependencies" [Inform. and Comput. 122(1995) 221-235]. Inf. Comput. 204(12): 1847-1851 (2006) - [j3]Christian Herrmann:
Corrigendum: Gluings of Modular Lattices. Order 23(2-3): 169-171 (2006) - 2000
- [j2]Christian Herrmann:
On the Size of Boolean Combinations of Subgroups of Finite Abelian Groups. Order 17(4): 387-390 (2000)
1990 – 1999
- 1996
- [j1]Christian Herrmann, Marcel Wild:
A Polynomial Algorithm for Testing Congruence Modularity. Int. J. Algebra Comput. 6(4): 379-388 (1996)
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-10-07 21:22 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:
