Author： Allender E. Jiao J. Mahajan M. Vinay V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 47-86
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
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. :
Access to resources
Recommend
The Ideal Membership Problem in Non-Commutative Polynomial Rings
Journal of Symbolic Computation, Vol. 22, Iss. 1, 1996-01 ,pp. :
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science, Vol. 209, Iss. 1, 1998-12 ,pp. :
Removing Ramsey theory: Lower bounds with smaller domain size
By Edmonds J.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. :
Parallel evaluation of arithmetic circuits
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :