Lower bounds on the time to compute a simple boolean function on a parallel random access machine

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/2964

Full metadata record

DC Field	Value	Language
dc.contributor	Luo, Zhi-Quan.	-
dc.contributor	Tsitsiklis, John N.	-
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.date	2003-04-29T15:27:53Z	-
dc.date	2003-04-29T15:27:53Z	-
dc.date	1986	-
dc.date.accessioned	2013-06-04T16:15:47Z	-
dc.date.available	2013-06-04T16:15:47Z	-
dc.date.issued	2013-06-05	-
dc.identifier	http://hdl.handle.net/1721.1/2964	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	Zhi-Quan Luo, John N. Tsitsiklis.	-
dc.description	Bibliography: leaf 6.	-
dc.description	Research supported by the Army Research Office under contract DAAAG-29-84-K-005	-
dc.format	6 leaves	-
dc.format	400199 bytes	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]	-
dc.relation	LIDS-P ; 1616	-
dc.subject	TK7855.M41 E3845 no.1616	-
dc.title	Lower bounds on the time to compute a simple boolean function on a parallel random access machine	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI