Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones

Information Processing Letters

Volumn 69, Issue 4, 1999, Pages 175-179

  Damm, Carsten ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DIGITAL ARITHMETIC; ELECTRIC NETWORK ANALYSIS; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

BOOLEAN SEMI-UNBOUNDED CIRCUITS; DEPTH-EFFICIENT SIMULATION;

LOGIC CIRCUITS;

EID: 0033604962     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00007-1     Document Type: Article

References (11)

1. A. Beimel, A. Gál, On arithmetic branching programs, in: Proc. 13th Annual IEEE Conference on Computational Complexity, 1998, pp. 68-80.
2. R.A. Demillo, R.J. Lipton, A probabilistic remark on algebraic program testing, Inform. Process. Lett. 7 (1978) 193-195.
3. A. Gál, Semi-unbounded fan-in circuits: Boolean vs. arithmetic, in: Proc. 10th Annual Conference on Structure in Complexity, 1995, pp. 82-87.
4. A. Gál, A. Wigderson, Boolean complexity classes vs. their arithmetic analogs, Random Structures Algorithms 9 (1-2) (1996) 99-111.
5. R. Lidl, H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, Cambridge, 1986.
6. K. Mulmuley, U. Vazirani, V. Vazirani, Matching is as easy as matrix inversion, in: Proc. 19th STOC, 1987, pp. 345-354.
7. K. Reinhardt, E. Allender, Making nondeterminism unambiguous, in: Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, pp. 244-253.
8. J. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27 (1980) 701-717.
9. H. Venkateswaran, Properties that characterize LOGCFL, J. Comput. System Sci. 43 (1991) 380-404.
10. A. Wigderson, NL/poly ⊆ ⊕L/poly, in: Proc. 9th Annual IEEE Conference on Structure in Complexity Theory, 1994, pp. 59-62.
11. R. Zippel, Probabilistic algorithms for sparse polynomials, in: Proc. International Symposium on Symbolic and Algebraic Computation (EUROSAM'79), Lecture Notes in Computer Science, Vol. 72, Springer, Berlin, 1979, pp. 216-226.