Karl-Heinz Niggl

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Implicit characterizations of FPTIME and NC revisited The Journal of Logic and Algebraic Programming	2009-12-18	Paper
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs SIAM Journal on Computing	2006-06-01	Paper
Control structures in programs and computational complexity Annals of Pure and Applied Logic	2005-04-21	Paper
The \(\mu\)-measure as a tool for classifying computational complexity Archive for Mathematical Logic	2001-07-16	Paper
scientific article; zbMATH DE number 1531370 (Why is no real title available?)	2001-02-28	Paper
Higher type recursion, ramification and polynomial time Annals of Pure and Applied Logic	2000-09-04	Paper
\({\mathcal M}^\omega\) considered as a programming language Annals of Pure and Applied Logic	2000-03-13	Paper
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited SIAM Journal on Computing	1999-10-28	Paper
Subrecursive functions on partial sequences Archive for Mathematical Logic	1999-10-05	Paper
A restricted computation model on Scott domains and its partial primitive recursive functionals Archive for Mathematical Logic	1999-04-13	Paper
Non-definability of the Ackermann function with type 1 partial primitive recursion Archive for Mathematical Logic	1996-12-15	Paper
scientific article; zbMATH DE number 873331 (Why is no real title available?)	1996-05-05	Paper
Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms Annals of Pure and Applied Logic	1996-02-14	Paper
Subrecursive hierarchies on Scott domains Archive for Mathematical Logic	1993-12-09	Paper

Research outcomes over time

This page was built for person: Karl-Heinz Niggl