Documents Related by Co-Citation

13 types and non-size increasing polynomial time computation – Linear
6 Characterising polytime through higher type recursion – S Bellantoni, K-H Niggl, H Schwichtenberg - 2000
5 Recognition of polynomial-time programs – C Frederiksen, N Jones - 2004
14 On characterizations of the basic feasible functional – R Irwin, B Kapron, J Royer
10 Feasible computation in higher types – B Kapron - 1991
2 recurrence and computational complexity I: Word recurrence and poly-time, Feasible Mathematics – Ramified - 1995
3 On the ubiquity of certain total type structures (Extended abstract – J Longley - 2004
3 of computability at higher types, I, Logic Colloquium 2000 – Notions - 2005
29 Polynomial and abstract subrecursive classes – K Mehlhorn - 1974
2 considered as a programming language, Theoretical Computer Science 5 – LCF - 1977
9 Subrecursive programming systems – J Royer, J Case - 1994
7 On the complexity of higher-order programs – J Shultis - 1985
3 Formal semantics – G Winskel - 1993
8 Foundations of Cryptography: Vol I Basic Tools – O Goldreich - 2005
36 A New Characterization Of Type 2 Feasibility – Kapron Cook, S. A. Cook - 1996
30 A foundational delineation of poly-time – Daniel Leivant - 1994
88 Functional interpretations of feasibly constructive arithmetic – Stephen Cook, Alasdair Urquhart - 1993
21 Programming languages capturing complexity classes – M Hofmann - 2000
13 Semantic frameworks for complexity – D Gurr - 1991