A lower bound for monotone arithmetic circuits computing 0-1 permanent

Author： Sengupta R.   Venkateswaran H.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 389-398

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A lower bound for range enclosure in interval arithmetic

By Hertling P.  

Theoretical Computer Science, Vol. 279, Iss. 1, 2002-05 ,pp. : 83-95

Elsevier

Access to resources Recommend Favorite

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. : 47-86

Elsevier

Access to resources Recommend Favorite

Parallel evaluation of arithmetic circuits

By Revol N.   Roch J.-L.  

Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. : 133-150

Elsevier

Access to resources Recommend Favorite

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits

By Sengupta R.   Venkateswaran H.  

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 197-212

Elsevier

Access to resources Recommend Favorite

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. : 395-421

Academic Press

Access to resources Recommend Favorite