Predicative Recursion and Computational Complexity (1992)

Cached

Download Links

by Stephen J. Bellantoni
Citations:45 - 3 self

Documents Related by Co-Citation

179 A New Recursion-Theoretic Characterization Of The Polytime Functions – Stephen Bellantoni, Stephen Cook - 1992
22 Predicative recursion and the polytime hierarchy – S Bellantoni - 1995
14 Function-algebraic characterizations of log and polylog parallel time – Stephen Bloch - 1994
782 A calculus for cryptographic protocols: The spi calculus – Martin Abadi, Andrew D. Gordon - 1999
150 The intrinsic computational difficulty of functions – A Cobham - 1964
101 Universally Composable Notions of Key Exchange and Secure Channels – Ran Canetti, Hugo Krawczyk - 2002
273 Mobile Values, New Names, and Secure Communication – Martín Abadi, Cédric Fournet - 2001
15 Predicative recurrence and computational complexity IV: Predicative functionals and poly-space. should be published – D Leivant, J-Y Marion - 1994
15 Subrecursion and lambda representation over free algebras (preliminary summary – D Leivant - 1990
8 Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME – P Clote - 1990
229 Languages That Capture Complexity Classes – Neil Immerman - 1987
7 Arithmetizing Uniform NC, Annals of pure and applied logic – B Allen - 1991
21 Ramified recurrence and computational complexity II: Substitution and poly-space – D Leivant, J-Y Marion - 1994
38 Classes of predictably computable functions – R W Ritchie - 1963
20 On polynomial Size Frege Proofs of Certain Combinatorial Principles – P Clote - 1993
208 Bounded-width polynomial-size branching programs recognize exactly those languages – A. Barrington - 1986
13 Reactively Secure Signature Schemes – Michael Backes, Birgit Pfitzmann, Michael Waidner - 2003
68 A General Composition Theorem for Secure Reactive Systems – Michael Backes, Birgit Pfitzmann, Michael Waidner - 2004
79 A Bisimulation Method for Cryptographic Protocols – Martín Abadi, Andrew D. Gordon - 1998