Title:
A Lower Bound for Noncommutative Monotone Arithmetic Circuits
A Lower Bound for Noncommutative Monotone Arithmetic Circuits
Author(s)
Sengupta, Rimli
Advisor(s)
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
We consider arithmetic circuits over the semiring (∑*, min, concat) and show that such circuits require super-polynomial size to compute the lexicographically minimum perfect matching of a bipartite graph. By defining monotone analogues of optimization classes such as OptP, OptL and OptSAC using the monotone analogues of their arithmetic circuit characterizations, our lower bound implies that this problem is not in monotone OptSAC. But we show that this problem is in monotone OptP, leading to a separation between these two classes.
Sponsor
Date Issued
1994
Extent
142282 bytes
Resource Type
Text
Resource Subtype
Technical Report