Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

SPAA
2005
ACM

favoriteEmaildiscussreport

84views Distributed And Parallel Com...» more SPAA 2005»

Is partial quantum search of a database any easier?

14 years 4 months ago

Is partial quantum search of a database any easier?

Download physics.princeton.edu

Lov K. Grover, Jaikumar Radhakrishnan

Real-time Traffic

Distributed And Parallel Computing | SPAA 2005 |

claim paper

Related Content

» Networking Historical Sources A DemandSide Driven Approach

» Lower bounds for predecessor searching in the cell probe model

» MICA desktop software for comprehensive searching of DNA databases

» The multirule partial sequenced route query

» InPicture Search Algorithm for ContentBased Image Retrieval

» Heuristicsbased query optimisation for SPARQL

» Higher Lower Bounds for NearNeighbor and Further Rich Problems

» Letting loose a SPIDER on a network of POMDPs generating quality guaranteed policies

» An Evaluation of Generic Bulk Loading Techniques

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	SPAA
Authors	Lov K. Grover, Jaikumar Radhakrishnan

Comments (0)