مرکز منطقه ای اطلاع رساني علوم و فناوري - A note on quantum black-box complexity of almost all Boolean functions

Title of article :

A note on quantum black-box complexity of almost all Boolean functions

Author/Authors :

Andris Ambainis، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1999

Pages :

From page :

To page :

Keywords :

quantum computing , computational complexity

Journal title :

Information Processing Letters

Serial Year :

1999

Journal title :

Information Processing Letters

Record number :

129101

Link To Document :