1331 search results - page 17 / 267 » Complexity bounds for zero-test algorithms |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
JC
2000
13 years 7 months ago
2000
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
AAAI
2012
11 years 10 months ago
2012
It has been shown recently that the complexity of belief tracking in deterministic conformant and contingent planning is exponential in a width parameter that is often bounded and...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...