On the computational complexity of Longley's H functional, presented at ICC'00 (2000) [5 citations — 2 self]
Download:
|
|
by James S. Royer
ftp://ftp.cis.syr.edu/users/royer/lh.ps
Add To MetaCart
Abstract:
Longley [Lon98b] discovered a functional H that, when added to PCF, yields a language that computes exactly SR, the sequentially realizable functionals of van Oosten [vO99]. We show that if P NP, then the computational complexity of H (and of similar SR-functionals) is inherently infeasible.
Citations
| 1604 | Computational Complexity – Papadimitriou - 1994 |
| 238 | Reducibility among Combinatorial Problems,” in Complexity of Computer Computations – Karp - 1972 |
| 90 | Theory of Recursive Functions and Eective Computability – Rogers - 1967 |
| 79 | Functional interpretations of feasible constructive arithmetic – Cook, Urquhart - 1993 |
| 61 | Computability and Complexity: From a Programming Perspective – Jones - 1997 |
| 37 | The sequentially realizable functionals – Longley |
| 16 | On characterizations of the basic feasible functional – Irwin, Kapron, et al. |
| 16 | Subrecursive programming systems – Royer, Case - 1994 |
| 12 | When is a Functional Program not a Functional Program – Longley - 1999 |
| 10 | Oosten, A combinatory algebra for sequential functionals of finite type, Models and Computability – van - 1999 |
| 9 | Strong reducibilities – Odifreddi - 1981 |
| 2 | Realizability models for sequential computation, draft of a paper based on a talk given at – Longley - 1998 |
