Hagen Huwig

Home * People * Hagen Huwig

Hagen Huwig [1] Hagen Huwig,

a German mathematician and computer scientist with research interests in computational complexity theory. While Ph.D. student at University of Dortmund during the mid 70s, he led a project team to develop the chess program Proscha [2] [3], written in PL/I for the IBM 370. Proscha played the First GI Computer Chess Tournament [4] [5].

Selected Publications

Hagen Huwig (1975). Bericht über eine Projektgruppe mit dem Thema Schachprogrammierung. Bericht Nr. 9, University of Dortmund (German)
Hagen Huwig (1976). Beziehungen zwischen beschränkter syntaktischer und beschränkter primitiver Rekursion. Dissertation, University of Dortmund, advisor Volker Claus (German)
Hagen Huwig (1976). A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds. MFCS 1976
Hagen Huwig, Volker Claus (1977). Das Äquivalenzproblem für spezielle Klassen von Loop-1-Pogrammen. Theoretical Computer Science 1977, Lecture Notes in Computer Science 48

Hagen Huwig (1980). Das P=NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema. 10. GI Jahrestagung 1980
Hagen Huwig, Axel Poigné (1980). A criterion common to various continuous completions of albegras and X-categories. CLAAP 1980
Hagen Huwig (1981). A Definition of the P=NP-Problem in Categories. FCT 1981
Hagen Huwig (1982). Ein Modell des P=NP -Problems mit einer positiven Lösung. Acta Informatica, Vol. 17
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1984). P-generic sets. Automata, Languages and Programming, Lecture Notes in Computer Science 172
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1987). Diagonalizing over Deterministic Polynomial Time. CSL 1987
Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig (1987). Diagonalizations over polynomial time computable sets. Theoretical Computer Science, Vol. 51]