28888 search results - page 392 / 5778 » Computability and complexity in analysis |
146
click to vote
AAAI
2007
15 years 9 months ago
2007
Horn description logics (Horn-DLs) have recently started to attract attention due to the fact that their (worst-case) data complexities are in general lower than their overall (i....
201
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
156
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We describe and explore a new perspective on the sample complexity of active learning. In many situations where it was generally believed that active learning does not help, we sh...
166
click to vote
CC
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
153
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...