The P-DNP problem for infinite Abelian groups

On the P-NP problem over real matrix rings

Theoretical Computer Science

P = NP for some structures over the binary words

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Two situations with unit-cost: ordered abelian semi-groups and some commutative rings

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

On Relativizations of the P =? NP Question for Several Structures

Electronic Notes in Theoretical Computer Science (ENTCS)

P=NP for some structures over the binary words

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Two situations with unit-cost: ordered abelian semi-groups and some commutative rings

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Real computational universality: the word problem for a class of groups with infinite presentation

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science