Paper Info
Title
A lower bound for monotone arithmetic circuits computing 0-1 permanent
Abstract
this paper we show that this, in fact, is not the case.We extend the framework in [1] to show that monotone arithmetic circuits require exponential sizeeven for computing the 0-1 permanent.
Year
DOI
Venue
1998
10.1016/S0304-3975(98)00130-3
Theor. Comput. Sci.
Keywords
DocType
Volume
Size lower bound,Permanent,Arithmetic circuit,monotone arithmetic circuits computing
Journal
209
Issue
ISSN
Citations 
1-2
Theoretical Computer Science
2
PageRank 
References 
Authors
0.41
6
2
Name
Order
Citations
PageRank
Rimli Sengupta113938.86
H. Venkateswaran220.41