Access Restriction

Author Hemaspaandra, Edith ♦ Hemaspaandra, Lane A. ♦ Zimand, Marius
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract We prove that, relative to some black box, there are languages for which polynomialtime quantum machines are exponentially faster than each classical machine almost everywhere.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2002-01-01