16 search results - page 1 / 4 » Higher type recursion, ramification and polynomial time |
APAL
2000
13 years 4 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
ISAAC
2010
Springer
13 years 2 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
FOSSACS
2004
Springer
13 years 10 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
AUSAI
2006
Springer
13 years 8 months ago
2006
Springer
A novel type of higher order pipelined neural network, the polynomial pipelined neural network, is presented. The network is constructed from a number of higher order neural networ...