skip to content
A lower bound to the complexity of Euclidean matching algorithms Preview this item
ClosePreview this item
Checking...

A lower bound to the complexity of Euclidean 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, 1984.
Series: LCSR-TR-59.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
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: 606071049
Series Title: LCSR-TR-59.
Responsibility: M.D. Grigoriadis and B. Kalantari.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks 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.

Linked Data


<http://www.worldcat.org/oclc/606071049>
library:oclcnum"606071049"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:contributor
<http://viaf.org/viaf/136641536>
rdf:typeschema:Organization
schema:name"Rutgers University. Department of Computer Science."
schema:contributor
schema:creator
schema:datePublished"1984"
schema:exampleOfWork<http://worldcat.org/entity/work/id/904643610>
schema:inLanguage"en"
schema:isPartOf
schema:name"A lower bound to the complexity of Euclidean matching algorithms"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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