268 search results - page 2 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
139
Voted
ALT
2010
Springer
15 years 2 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
104
click to vote
TLCA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
113
click to vote
FOCS
1998
IEEE
15 years 6 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...
112
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
116
Voted
APLAS
2004
ACM
15 years 7 months ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however eï...