10054 search results - page 321 / 2011 » On the Complexity of Function Learning |
115
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
129
click to vote
ECCC
2000
15 years 3 months ago
2000
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
117
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. We present a deep embedding of Bellantoni and Cook’s syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to...
129
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
149
click to vote
ECML
2004
Springer
15 years 9 months ago
2004
Springer
Although tabular reinforcement learning (RL) methods have been proved to converge to an optimal policy, the combination of particular conventional reinforcement learning techniques...