Christian Herrmann

According to our database, Christian Herrmann authored at least 10 papers between 1996 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2016

Homogeneous Modular Lattices are Distributive.

Christian Herrmann

Order, 2016

Computational Complexity of Quantum Satisfiability.

Christian Herrmann, Martin Ziegler

J. ACM, 2016

On the consistency problem for modular lattices and related structures.

Christian Herrmann, Yasuyuki Tsukamoto, Martin Ziegler

Int. J. Algebra Comput., 2016

2013

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines.

Christian Herrmann, Johanna Sokoli, Martin Ziegler

Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

2010

On the equational theory of projection lattices of finite von Neumann factors.

Christian Herrmann

J. Symb. Log., 2010

Expressiveness and Computational Complexity of Geometric Quantum Logic

Christian Herrmann, Martin Ziegler

CoRR, 2010

2006

Corrigendum: Gluings of Modular Lattices.

Christian Herrmann

Order, 2006

Corrigendum to "On the undecidability of implications between embedded multivalued database dependencies" [Inform. and Comput. 122(1995) 221-235].

Christian Herrmann

Inf. Comput., 2006

2000

On the Size of Boolean Combinations of Subgroups of Finite Abelian Groups.

Christian Herrmann

Order, 2000

1996

A Polynomial Algorithm for Testing Congruence Modularity.

Christian Herrmann, Marcel Wild

Int. J. Algebra Comput., 1996