A. Chiu, G. Davida, and B. Litow. NC1 division. Manuscript, November 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Fast parallel circuits for the quantum Fourier transform - Cleve, Watrous (2000) (6 citations) (Correct)
....and 2n 1 internal nodes. Thus, the entire process can be performed with depth O( log n) 2 ) and size O(n 3 ) There are alternative methods for performing iterated multiplication achieving various combinations of depth and size. In particular, it was recently proved by Chiu, Davida, and Litow [9] (improving on results in [4] that a product such as we have above can be computed by O(log n) depth boolean circuits of polynomial size. While the size is likely to exceed the O(n 3 ) bound obtained above, the result has an interesting consequence regarding simulations of logarithmic depth ....
A. Chiu, G. Davida, and B. Litow. NC1 division. Manuscript, November 1999.
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
No context found.
A. Chiu, G. Davida, and B. Litow. NC1 division. Manuscript, November 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC