16430 search results - page 841 / 3286 » On Computable Tree Functions |
180
click to vote
FCT
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
231
click to vote
SIGSOFT
2007
ACM
16 years 8 months ago
2007
ACM
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
209
click to vote
STOC
2010
ACM
16 years 13 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
230
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
205
click to vote
MCU
1998
15 years 9 months ago
1998
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...