PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Kabanets, Valentine"

Author of the publication

copydeleteadd this publication to your clipboard
In search of an easy witness: exponential time vs. probabilistic polynomial time.

, , and . J. Comput. Syst. Sci., 65 (4): 672-694 (2002)

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.

No persons found for author name Kabanets, Valentine
add a person with the name Kabanets, Valentine
 

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)Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword., and . Computational Complexity, 16 (2): 113-114 (2007)The black-box query complexity of polynomial summation., , , and . Electronic Colloquium on Computational Complexity (ECCC), (2007)Is the Valiant-Vazirani Isolation Lemma Improvable?, and . Electronic Colloquium on Computational Complexity (ECCC), (2011)Hardness amplification via space-efficient direct products, and . Electronic Colloquium on Computational Complexity (ECCC), (2005)Fourier Concentration from Shrinkage., and . Electronic Colloquium on Computational Complexity (ECCC), (2013)The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs., , , and . Computational Complexity Conference, page 135-. IEEE Computer Society, (2003)Lower Bounds against Weakly Uniform Circuits., and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 408-419. Springer, (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 . MFCS, volume 83 of LIPIcs, page 1:1-1:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)