Hagen Huwig

According to our database, Hagen Huwig authored at least 9 papers between 1976 and 1990.

Collaborative distances:

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

1990

A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category.

Hagen Huwig, Axel Poigné

Theor. Comput. Sci., 1990

1987

Diagonalizations over Polynomial Time Computable Sets.

Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig

Theor. Comput. Sci., 1987

Diagonalizing over Deterministic Polynomial Time.

Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig

Proceedings of the CSL '87, 1987

1982

Ein Modell des <i>P=NP</i> -Problems mit einer positiven Lösung.

Hagen Huwig

Acta Informatica, 1982

1981

A Definition of the P=NP-Problem in Categories.

Hagen Huwig

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Das P=NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema.

Hagen Huwig

Proceedings of the GI - 10. Jahrestagung, Saarbrücken, 30. September, 1980

A criterion common to various continuous completions of albegras and X-categories.

Hagen Huwig, Axel Poigné

Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1977

Das Äquivalenzproblem für spezielle klassen von Loop-1-programmen.

Hagen Huwig, Volker Claus

Proceedings of the Theoretical Computer Science, 1977

1976

A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds.

Hagen Huwig

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976