( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
AC0p Lower Bounds Against MCSP via the Coin Problem.

, , , , , и . ICALP, том 132 из LIPIcs, стр. 66:1-66:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Wolter Russell

Dieter Russell

Russell Kleckley

Russell Stinson

Emma Russell

 

Другие публикации лиц с тем же именем

An Entropic Proof of Chang's Inequality, , и . CoRR, (2012)A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion., и . IACR Cryptology ePrint Archive, (1999)Hill-Climbing vs. Simulated Annealing for Planted Bisection Problems.. RANDOM-APPROX, том 2129 из Lecture Notes in Computer Science, стр. 2-5. Springer, (2001)Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm, , и . Electron. Colloquium Comput. Complex., (1997)Stabbing Planes., , , , , , и . Electron. Colloquium Comput. Complex., (2017)On the complexity of succinct zero-sum games, , , и . Electron. Colloquium Comput. Complex., (2004)Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space., , и . Electron. Colloquium Comput. Complex., (2011)The Fine-Grained Complexity of Strengthenings of First-Order Logic., и . Electron. Colloquium Comput. Complex., (2019)Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds, и . Electron. Colloquium Comput. Complex., (2002)Models of Greedy Algorithms for Graph Problems., и . Algorithmica, 54 (3): 269-317 (2009)