See this document in CiteSeerX!

On Threshold Circuits And Polynomial Computation  (Make Corrections)  (51 citations)
John H. Reif And Stephen R. Tate
SIAM J. Comput.



  Home/Search   Context   Related

 
View or download:
unt.edu/~srt/papers/thresh.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  unt.edu/~srt/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field Z P (n) Circuits, where each node computes either multiple sums or products of integers modulo a prime P (n). In particular, it is proved that all... (Update)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@article{ reif92threshold,
    author = "John H. Reif and Stephen R. Tate",
    title = "On Threshold Circuits and Polynomial Computation",
    journal = "SIAM J. Comput.",
    volume = "21",
    number = "5",
    pages = "896-908",
    year = "1992",
    url = "citeseer.ist.psu.edu/reif87threshold.html" }
Citations (may not include all citations):
376   A learning algorithm for Boltzmann machines (context) - Ackley, Hinton et al. - 1985
106   Connectionist models and their properties (context) - Feldman, Ballard - 1982
91   Log depth circuits for division and related problems (context) - Beame, Cook et al. - 1986
36   From Images to Surfaces: A Computational Study of the Human .. (context) - Grimson - 1981
25   A First Course in Abstract Algebra (context) - Fraleigh - 1982
7   Parallel solution of certain Toeplitz linear systems (context) - Bini - 1984
2   Fast parallel algorithms for polynomial division over arbitr.. (context) - Bini, Pan - 1984
2   depth using O (context) - Hastad, Leighton et al.



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cse.unt.edu/~srt/papers/):   More
Searching in an Unknown Environment: An Optimal Randomized.. - Kao, Reif, Tate (1993)   (Correct)
Band Ordering in Lossless Compression of Multispectral Images - Tate (1994)   (Correct)
Stable Computation of the Complex Roots of Unity - Stephen Tate Department   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC