مرکز منطقه ای اطلاع رساني علوم و فناوري - Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables

Title of article :

Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables

Author/Authors :

Yaoyun Shi، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Quantum computation , sensitivity , Boolean functions , computational complexity

Journal title :

Information Processing Letters

Serial Year :

2000

Journal title :

Information Processing Letters

Record number :

129249

Link To Document :