Skip to main content

University of Minnesota / Driven to DiscoverUniversity of Minnesota

Libraries

View Item 
On the Complexity of Pattern Recognition Algorithms On a Tree-Structured Parallel Computer
Gorin, A.L.; Roe, D.B.; Greenberg, A.G. (1989)
Thumbnail
View/Download file
Persistent link to this item
https://hdl.handle.net/11299/5109
Services
Title
On the Complexity of Pattern Recognition Algorithms On a Tree-Structured Parallel Computer
Authors
Issue Date
1989
Appears in collections
IMA Preprints Series [2486]
Identifiers
594
Related to
Institute for Mathematics and Its Applications>IMA Preprints Series
Suggested Citation
Gorin, A.L.; Roe, D.B.; Greenberg, A.G.. (1989). On the Complexity of Pattern Recognition Algorithms On a Tree-Structured Parallel Computer. Retrieved from the University of Minnesota Digital Conservancy, https://hdl.handle.net/11299/5109.
Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.