Literature list from the university bibliography

Results: 146
Created on: Thu, 25 Apr 2024 23:03:20 +0200 in 0.0668 sec


Bellantoni, Stephen J.; Niggl, Karl-Heinz; Schwichtenberg, Helmut
Higher type recursion, ramification and polynomial time. - In: Annals of pure and applied logic, ISSN 1873-2461, Bd. 104 (2000), 1/3, S. 17-30

http://dx.doi.org/10.1016/S0168-0072(00)00006-3
Niggl, Karl-Heinz;
[Rezension von: Bellantoni, Stephen; Cook, Stephen, A new recursion-theoretic characterization of the polytime functions...]. - In: The bulletin of symbolic logic. - Cambridge : Cambridge Univ. Press, ISSN 1079-8986, 3, S. 351-353
, Rezension von
Rezension von
Niggl, Karl-Heinz;
The mu-measure as a tool for classifying computational complexity. - In: Archive for mathematical logic, ISSN 0933-5846, Bd. 39 (2000), 7, S. 515-539

Bellantoni, Stephen J.; Niggl, Karl-Heinz
Ranking primitive recursions: the low Grzegorczyk classes revisited. - In: SIAM journal on computing, ISSN 1095-7111, Bd. 29 (1999), 2, S. 401-415

https://doi.org/10.1137/S009753979528175X
Niggl, Karl-Heinz;
M [omega] considered as a programming language. - In: Annals of pure and applied logic, ISSN 1873-2461, Bd. 99 (1999), 1/3, S. 73-92

http://dx.doi.org/10.1016/S0168-0072(99)80002-5
Alon, Noga; Dietzfelbinger, Martin; Miltersen, Peter Bro; Petrank, Erez; Tardos, Gábor
Linear hash functions. - In: Journal of the ACM, ISSN 1557-735X, Bd. 46 (1999), 5, S. 667-683

https://doi.org/10.1145/324133.324179