From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

A Group-Theoretic Approach to Fast Matrix Multiplication.

H. Cohn, и C. Umans. FOCS, стр. 438-449. IEEE Computer Society, (2003)

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.

Fast Modular Composition in any Characteristic.K. Kedlaya, и C. Umans. FOCS, стр. 146-155. IEEE Computer Society, (2008)A Group-Theoretic Approach to Fast Matrix Multiplication.H. Cohn, и C. Umans. FOCS, стр. 438-449. IEEE Computer Society, (2003)The Minimum Equivalent DNF Problem and Shortest Implicants.C. Umans. FOCS, стр. 556-563. IEEE Computer Society, (1998)Fast polynomial factorization and modular composition in small characteristic.C. Umans. STOC, стр. 481-490. ACM, (2008)On the Complexity and Inapproximability of Shortest Implicant Problems.C. Umans. ICALP, том 1644 из Lecture Notes in Computer Science, стр. 687-696. Springer, (1999)On the Power of Quantum Fourier Sampling.B. Fefferman, и C. Umans. TQC, том 61 из LIPIcs, стр. 1:1-1:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Complexity of Rationalizing Matchings.S. Kalyanaraman, и C. Umans. ISAAC, том 5369 из Lecture Notes in Computer Science, стр. 171-182. Springer, (2008)Pseudorandomness for Approximate Counting and Sampling.R. Shaltiel, и C. Umans. CCC, стр. 212-226. IEEE Computer Society, (2005)On the Complexity of Approximating the VC Dimension.E. Mossel, и C. Umans. CCC, стр. 220-225. IEEE Computer Society, (2001)On beating the hybrid argument.B. Fefferman, R. Shaltiel, C. Umans, и E. Viola. ITCS, стр. 468-483. ACM, (2012)