( en | de | ru )

 

Disambiguation of "Kabanets, Valentine"

Author of the publication

copydeleteadd this publication to your clipboard
AC0p Lower Bounds against MCSP via the Coin Problem.

, , , , , and . Electron. Colloquium Comput. Complex., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Valentine Tschebotareff

Valentine Reimer

Valentine Mazur

Valentine Hirsch

Valentine Ojo

 

Other publications of authors with the same name

New Direct-Product Testers and 2-Query PCPs., , and . SIAM J. Comput., 41 (6): 1722-1768 (2012)Chernoff-Type Direct Product Theorems., , and . CRYPTO, volume 4622 of Lecture Notes in Computer Science, page 500-516. Springer, (2007)Does Looking Inside a Circuit Help?, , , , and . Electron. Colloquium Comput. Complex., (2017)The black-box query complexity of polynomial summation., , , and . Electron. Colloquium Comput. Complex., (2007)Lower Bounds against Weakly Uniform Circuits., and . Electron. Colloquium Comput. Complex., (2012)Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates., , , , and . ACM Trans. Comput. Theory, 13 (4): 23:1-23:37 (2021)Fourier Concentration from Shrinkage., and . Electron. Colloquium Comput. Complex., (2013)LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic., , , and . FOCS, page 770-780. IEEE, (2021)On the Complexity of Succinct Zero-Sum Games., , , and . Comput. Complex., 17 (3): 353-376 (2008)Recognizability Equals Definability for Partial k-Paths.. ICALP, volume 1256 of Lecture Notes in Computer Science, page 805-815. Springer, (1997)