On Feasible Numbers (1995)

Cached

Download Links

by Vladimir Yu. Sazonov
Venue:Logic and Computational Complexity, LNCS Vol. 960
Citations:5 - 1 self

Documents Related by Co-Citation

81 Existence and feasibility in arithmetic – R Parikh - 1971
52 Languages which capture complexity classes – Neil Immerman - 1987
150 The intrinsic computational difficulty of functions – A Cobham - 1964
11 Feasible Computations and Provable Complexity Properties – J Hartmanis - 1978
3 Constructive type theory–an introduction – R C Backhouse - 1989
5 Set theory with type restrictions – N G deBruijn - 1975
4 On the Meaning of Logical Rules. I: Syntax Versus Semantics – Jean-Yves Girard - 1997
3 Type-theoretical Grammar. Oxford Science Publications – Aarne Ranta - 1994
5 Formalizing Reference Types in NuPRL – P Naumov - 1998
5 On the meaning of logical rules II: multiplicatives and additives – Jean-Yves Girard - 1998
27 Reflection in constructive and non-constructive automated reasoning – F Giunchiglia, A Smaill - 1988
17 The polynomial hierarchy and intuitionistic bounded arithmetic, Structure in Complexity Theory – S Buss - 1986
14 Predicative recurrence in finite type – D Leivant - 1994
8 Search algorithms in type theory – James L. Caldwell, Ian P. Gent, Judith Underwood - 2000
10 Turing machine characterizations of feasible functionals of all finite types – A Seth - 1995
5 Notes on the Simply Typed Lambda Calculus – Peter Aczel - 1998
24 Extension of Martin-Löf's Type Theory with Record Types and Subtyping – Gustavo Betarte, Alvaro Tasistro - 1998
15 NuPRL’s class theory and its applications – Robert L. Constable, Jason Hickey - 2000
20 Computational Foundations of Basic Recursive Function Theory – Robert L. Constable, Scott Fraser Smith - 1988