( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.

, , , и . STOC, стр. 519-528. ACM, (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.

Albertas Julijonas Aviza

Denis Lucy Avilés Irahola

Sharon Aviran

Carl D' Avis

Christos Avierinos

 

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

Operator Scaling: Theory, Applications and Connections. (2017)Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity., , и . Comput. Complex., 5 (3/4): 191-204 (1995)Superpolynomial Lower Bounds for Monotone Span Programs., , и . Comb., 19 (3): 301-319 (1999)Symmetric LDPC Codes and Local Testing., и . Property Testing, том 6390 из Lecture Notes in Computer Science, Springer, (2010)Composition of the Universal Relation., и . Advances In Computational Complexity Theory, том 13 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 119-134. DIMACS/AMS, (1990)Expander codes over reals, Euclidean sections, and compressed sensing., , и . Allerton, стр. 1231-1234. IEEE, (2009)An Optimal "It Ain't Over Till It's Over" Theorem., , и . STOC, стр. 853-866. ACM, (2023)On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity., , и . SCT, стр. 78-87. IEEE Computer Society, (1990)On data structures and asymmetric communication complexity., , , и . STOC, стр. 103-111. ACM, (1995)Self-Testing/Correcting for Polynomials and for Approximate Functions, , , , и . STOC, стр. 32-42. ACM, (1991)