AbstractWe show that functions with convergent real power series can be well approximated by two classes of polynomial-size small-weight threshold circuits: depth-three circuits with threshold gates on all levels and depth-four circuits with threshold gates on the first two levels and AND–OR gates on the last two. This is done without restricting the input to a fixed closed subinterval of the interval of convergence of the series. We also point out that rational functions and the logarithm of x in base b can be well approximated by the same classes of circuits when both x and b are given as input
AbstractIn this paper we show that there is a close relationship between the energy complexity and t...
Abstract—We initiate a systematic study of constant depth Boolean circuits built using exact thresho...
Abstract. In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate ...
AbstractWe show that functions with convergent real power series can be well approximated by two cla...
Abstract. A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node com...
AbstractMotivated by the problem of understanding the limitations of threshold networks for represen...
We investigate the complexity of computations with constant-depth threshold circuits. Such circuits ...
AbstractWe show that for any constant d, complex roots of degree d univariate rational (or Gaussian ...
AbstractWe examine a powerful model of parallel computation: polynomial size threshold circuits of b...
Abstract. In this paper we study small depth circuits that contain threshold gates (with or without ...
AbstractConstant-depth polynomial-size threshold circuits are usually classified according to their ...
In this talk we will consider various classes defined by small depth polynomial size circuits which ...
The main result of this paper is a \Omega\Gamma n 1=4 ) lower bound on the size of a sigmoidal cir...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in ....
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in ....
AbstractIn this paper we show that there is a close relationship between the energy complexity and t...
Abstract—We initiate a systematic study of constant depth Boolean circuits built using exact thresho...
Abstract. In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate ...
AbstractWe show that functions with convergent real power series can be well approximated by two cla...
Abstract. A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node com...
AbstractMotivated by the problem of understanding the limitations of threshold networks for represen...
We investigate the complexity of computations with constant-depth threshold circuits. Such circuits ...
AbstractWe show that for any constant d, complex roots of degree d univariate rational (or Gaussian ...
AbstractWe examine a powerful model of parallel computation: polynomial size threshold circuits of b...
Abstract. In this paper we study small depth circuits that contain threshold gates (with or without ...
AbstractConstant-depth polynomial-size threshold circuits are usually classified according to their ...
In this talk we will consider various classes defined by small depth polynomial size circuits which ...
The main result of this paper is a \Omega\Gamma n 1=4 ) lower bound on the size of a sigmoidal cir...
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in ....
NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract included in ....
AbstractIn this paper we show that there is a close relationship between the energy complexity and t...
Abstract—We initiate a systematic study of constant depth Boolean circuits built using exact thresho...
Abstract. In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate ...