138 search results - page 6 / 28 » Entropy Numbers of Linear Function Classes |
STOC
1996
ACM
13 years 11 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
STACS
1999
Springer
13 years 11 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
TFS
2008
13 years 6 months ago
2008
Abstract--This study presents a functional-link-based neurofuzzy network (FLNFN) structure for nonlinear system control. The proposed FLNFN model uses a functional link neural netw...
RSA
2008
13 years 7 months ago
2008
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
TCS
2008
13 years 7 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...