A lower bound for monotone arithmetic circuits computing \(0-1\) permanent
type: Item
instance of: scholarly article
title: A lower bound for monotone arithmetic circuits computing \(0-1\) permanent
zbMATH Open document ID: 0912.68056
DOI: 10.1016/S0304-3975(98)00130-3
author: Rimli Sengupta
author: H. Venkateswaran
published in: Theoretical Computer Science
publication date: 1999-02-02T00:00:00Z
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1245585
zbMATH Keywords: algebraic circuits
zbMATH Keywords: permanent of matrices
MaRDI profile type: Publication
cites work: Some Exact Complexity Results for Straight-Line Computations over Semirings
cites work: Lower bounds on monotone complexity of the logical permanent
cites work: On uniform circuit complexity
cites work: On the depth complexity of formulas
cites work: PP is as Hard as the Polynomial-Time Hierarchy
cites work: The complexity of computing the permanent
cites work: Circuit Definitions of Nondeterministic Complexity Classes
description: scientific article; zbMATH DE number 1245585