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

74 Existence and feasibility in arithmetic – R Parikh - 1971
49 Languages which Capture Complexity Classes – N Immerman - 1983
129 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
8 Experience using type theory as a foundation for computer science – Robert L Constable - 1995
5 Formalizing Reference Types in NuPRL – P Naumov - 1998
8 Automating the instantiation of existentially quantified variables – Brigitte Pientka, Christoph Kreitz
12 Foundations for the Implementation of Higher-Order Subtyping – Karl Crary - 1997
9 Constructively formalizing automata – L Robert, Paul B Jackson Constable, Pavel Naumov, Juan Uribe
5 On the meaning of logical rules II: multiplicatives and additives – Jean-Yves Girard - 1998
14 NuPRL’s class theory and its applications – Robert L. Constable, Jason Hickey - 2000
11 Computational Complexity and Induction for Partial Computable Functions in Type Theory – Robert L. Constable, Karl Crary - 1999
27 Reflection in constructive and non-constructive automated reasoning – F Giunchiglia, A Smaill - 1988
26 Semantic Foundations for Embedding HOL in Nuprl – Douglas J. Howe - 1996
18 Finitely stratified polymorphism – D Leivant - 1991