10054 search results - page 181 / 2011 » On the Complexity of Function Learning |
111
Voted
WOLLIC
2010
Springer
15 years 5 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
91
Voted
ATAL
2004
Springer
15 years 6 months ago
2004
Springer
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
75
Voted
ESANN
2008
15 years 2 months ago
2008
In this paper we have defined a novel activation function called the multi-level signum for the real and complex valued associative memories. The major motivation of such a functio...
94
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
EOR
2008
15 years 23 days ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...