( en | de | ru )

 

Disambiguation of "Umans, Christopher"

Author of the publication

copydeleteadd this publication to your clipboard
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411).

, , , and . Dagstuhl Reports, 6 (10): 13-32 (2016)

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.

Anna Chana-Golda Umanska

Erwin Umanski

Christopher Christopher

Jörg Christopher

Christopher Hailey

 

Other publications of authors with the same name

Fast Modular Composition in any Characteristic., and . FOCS, page 146-155. IEEE Computer Society, (2008)A Group-Theoretic Approach to Fast Matrix Multiplication., and . FOCS, page 438-449. IEEE Computer Society, (2003)The Minimum Equivalent DNF Problem and Shortest Implicants.. FOCS, page 556-563. IEEE Computer Society, (1998)On beating the hybrid argument., , , and . ITCS, page 468-483. ACM, (2012)Fast matrix multiplication using coherent configurations., and . SODA, page 1074-1087. SIAM, (2013)Reconstructive Dispersers and Hitting Set Generators.. APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, page 460-471. Springer, (2005)Pseudo-Random Generators for All Hardnesses.. CCC, page 11. IEEE Computer Society, (2002)Hardness of Approximating Sigma2p Minimization Problems.. FOCS, page 465-474. IEEE Computer Society, (1999)Fast polynomial factorization and modular composition in small characteristic.. STOC, page 481-490. ACM, (2008)On the Complexity and Inapproximability of Shortest Implicant Problems.. ICALP, volume 1644 of Lecture Notes in Computer Science, page 687-696. Springer, (1999)