Author:
Aehlig Klaus,Berger Ulrich,Hofmann Martin,Schwichtenberg Helmut
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. K. Aehlig, H. Schwichtenberg, A syntactical analysis of non-size-increasing polynomial time computation, in: Proc. 15th IEEE Symp. on Logic in Computer Science (LICS ’00), Santa Barbara, California, June 2000, pp. 84–91.
2. Higher type recursion, ramification and polynomial time;Bellantoni;Ann. Pure Appl. Logic,2000
3. Program extraction from normalization proofs;Berger,1993
4. V.-H. Caseiro, Equations for defining poly-time functions, Ph.D. Thesis, University of Oslo, 1997. ftp.ifi.uio.no/pub/vuokko/.
5. Über eine bisher noch nicht benützte Erweiterung des finiten Standpunkts;Gödel;Dialectica,1958
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献