Karl-Heinz Niggl

Available identifiers

Publication	Date of Publication	Type
Implicit characterizations of FPTIME and NC revisited	2009-12-18	Paper
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs	2006-06-01	Paper
Control structures in programs and computational complexity	2005-04-21	Paper
The \(\mu\)-measure as a tool for classifying computational complexity	2001-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4513587	2001-02-28	Paper
Higher type recursion, ramification and polynomial time	2000-09-04	Paper
\({\mathcal M}^\omega\) considered as a programming language	2000-03-13	Paper
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited	1999-10-28	Paper
Subrecursive functions on partial sequences	1999-10-05	Paper
A restricted computation model on Scott domains and its partial primitive recursive functionals	1999-04-13	Paper
Non-definability of the Ackermann function with type 1 partial primitive recursion	1996-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4876432	1996-05-05	Paper
Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms	1996-02-14	Paper
Subrecursive hierarchies on Scott domains	1993-12-09	Paper

This page was built for person: Karl-Heinz Niggl