99 search results - page 1 / 20 » Uniform Characterizations of Complexity Classes of Functions |
33
Voted
IJFCS
2000
14 years 9 months ago
2000
ALT
2003
Springer
15 years 6 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
COLT
1999
Springer
15 years 1 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
COCO
1992
Springer
15 years 1 months ago
1992
Springer
We characterize the classes of functions computable by uniform log-depth (NC1) and polylog-depth circuit families as closures of a set of base functions. (The former is equivalent...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...