( en | de | ru )

 

Disambiguation of "Volkovich, Ilya"

Author of the publication

copydeleteadd this publication to your clipboard
Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae.

, , and . CCC, page 273-282. IEEE Computer Society, (2011)

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.

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Christoffel

Ilya Pavlyukevich

 

Other publications of authors with the same name

Deterministic polynomial identity tests for multilinear bounded-read formulae., , and . Comput. Complex., 24 (4): 695-776 (2015)Computations beyond Exponentiation Gates and Applications.. Electron. Colloquium Comput. Complex., (2015)The Complexity of Finding S-factors in Regular Graphs., , , and . Electron. Colloquium Comput. Complex., (2019)Read-Once Polynomial Identity Testing., and . Electron. Colloquium Comput. Complex., (2010)The Power of Natural Properties as Oracles., , and . Electron. Colloquium Comput. Complex., (2017)Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae., , and . CCC, page 273-282. IEEE Computer Society, (2011)On Some Computations on Sparse Polynomials.. APPROX-RANDOM, volume 81 of LIPIcs, page 48:1-48:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On Learning, Lower Bounds and (un)Keeping Promises.. ICALP (1), volume 8572 of Lecture Notes in Computer Science, page 1027-1038. Springer, (2014)One (more) line on the most Ancient Algorithm in History.. CoRR, (2018)The Final Nail in the Coffin of Statistically-Secure Obfuscator.. Electron. Colloquium Comput. Complex., (2021)