Title:
A Lower Bound for Noncommutative Monotone Arithmetic Circuits

Simple item page
dc.contributor.author Sengupta, Rimli en_US
dc.date.accessioned 2005-06-17T17:57:40Z
dc.date.available 2005-06-17T17:57:40Z
dc.date.issued 1994 en_US
dc.description.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. en_US
dc.format.extent 142282 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/6711
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.relation.ispartofseries CC Technical Report; GIT-CC-94-05 en_US
dc.subject Super-polynomial size
dc.subject Arithmetic circuits
dc.subject Semirings
dc.subject Bipartite graphs
dc.subject Analogues
dc.subject OptP
dc.subject OptL
dc.subject OptSAC
dc.subject Lower bounds
dc.subject Noncommutative monotone arithmetic circuits
dc.title A Lower Bound for Noncommutative Monotone Arithmetic Circuits en_US
dc.type Text
dc.type.genre Technical Report
dspace.entity.type Publication
local.contributor.corporatename College of Computing
local.relation.ispartofseries College of Computing Technical Report Series
relation.isOrgUnitOfPublication c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication 35c9e8fc-dd67-4201-b1d5-016381ef65b8
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GIT-CC-94-05.pdf
Size:
138.95 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Research Publications