Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Search by expertise, name or affiliation
Lower bounds on the complexity of polytope range searching
Bernard Chazelle
Computer Science
Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
54
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Lower bounds on the complexity of polytope range searching'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Range Searching
100%
Polytope
58%
Lower bound
42%