Author： Revol N. Roch J.-L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.162, Iss.1, 1996-08, pp. : 133-150
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On TC0, AC0, and Arithmetic Circuits
By Agrawal M. Allender E. Datta S.
Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. :
Access to resources
Recommend
A lower bound for monotone arithmetic circuits computing 0-1 permanent
By Sengupta R. Venkateswaran H.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Non-commutative arithmetic circuits: depth reduction and size lower bounds
By Allender E. Jiao J. Mahajan M. Vinay V.
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Efficient parallel solutions of linear algebraic circuits
Journal of Parallel and Distributed Computing, Vol. 64, Iss. 1, 2004-01 ,pp. :