10054 search results - page 167 / 2011 » On the Complexity of Function Learning |
90
Voted
CADE
1992
Springer
15 years 4 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
75
Voted
ACL
1996
15 years 2 months ago
1996
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...
101
Voted
SAS
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
107
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
105
click to vote
CADE
2008
Springer
15 years 2 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...