13603 search results - page 14 / 2721 » On the Computational Complexity of Cut-Reduction |
105
click to vote
STOC
1993
ACM
15 years 3 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...
WSC
2004
15 years 1 months ago
2004
This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involv...
TC
2008
14 years 11 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...