16430 search results - page 106 / 3286 » On Computable Tree Functions |
132
Voted
AML
2008
15 years 3 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
143
Voted
WIOPT
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—This paper considers the following network computation problem:
152
click to vote
CRYPTO
1990
Springer
15 years 7 months ago
1990
Springer
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
108
Voted
DAC
2010
ACM
15 years 7 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...