skip to content
A lower bound to the complexity of Euclidean and rectilinear matching algorithms
ClosePreview this item

A lower bound to the complexity of Euclidean and rectilinear matching algorithms

Author: Michael D Grigoriadis; Bahman Kalantari; Rutgers University. Department of Computer Science.
Publisher: New Brunswick, N.J. : Department of Computer Science, Rutgers University, 1985.
Series: LCSR-TR-69.
Edition/Format:   Book : EnglishView all editions and formats
Rating:

(not yet rated) 0 with reviews - Be the first.

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael D Grigoriadis; Bahman Kalantari; Rutgers University. Department of Computer Science.
OCLC Number: 606070933
Series Title: LCSR-TR-69.
Responsibility: by M.D. Grigoriadis and B. Kalantari.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.