Result 41 to 60 of 1569 total
Testing and reconstruction of Lipschitz functions with applications to data privacy. (English)
Electron. Colloq. Comput. Complex. 18, 57 (2011).
41
Extractors for circuit sources. (English)
Electron. Colloq. Comput. Complex. 18, 56 (2011).
42
Dense locally testable codes cannot have constant rate and distance. (English)
Electron. Colloq. Comput. Complex. 18, 55 (2011).
43
Tight lower bounds for 2-query lccs over finite fields. (English)
Electron. Colloq. Comput. Complex. 18, 54 (2011).
44
The complexity of solving multiobjective optimization problems and its relation to multivalued functions. (English)
Electron. Colloq. Comput. Complex. 18, 53 (2011).
45
On the complexity of group isomorphism. (English)
Electron. Colloq. Comput. Complex. 18, 52 (2011).
46
A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the gap-Hamming-distance problem. (English)
Electron. Colloq. Comput. Complex. 18, 51 (2011).
47
Accelerated slide- and LLL-reduction. (English)
Electron. Colloq. Comput. Complex. 18, 50 (2011).
48
Almost k-wise vs. K-wise independent permutations, and uniformity for general group actions. (English)
Electron. Colloq. Comput. Complex. 18, 49 (2011).
49
Linear systems over Abelian groups. (English)
Electron. Colloq. Comput. Complex. 18, 48 (2011).
50
Two comments on targeted canonical derandomizers. (English)
Electron. Colloq. Comput. Complex. 18, 47 (2011).
51
Black-box identity testing of depth-4 multilinear circuits. (English)
Electron. Colloq. Comput. Complex. 18, 46 (2011).
52
Property testing lower bounds via communication complexity. (English)
Electron. Colloq. Comput. Complex. 18, 45 (2011).
53
Noisy interpolation of sparse polynomials, and applications. (English)
Electron. Colloq. Comput. Complex. 18, 44 (2011).
54
A linear-optical proof that the permanent is #P-hard. (English)
Electron. Colloq. Comput. Complex. 18, 43 (2011).
55
Efficiently coding for interactive communication. (English)
Electron. Colloq. Comput. Complex. 18, 42 (2011).
56
Testing computability by width-two obdds. (English)
Electron. Colloq. Comput. Complex. 18, 41 (2011).
57
Strong direct product theorems for quantum communication and query complexity. (English)
Electron. Colloq. Comput. Complex. 18, 40 (2011).
58
In brute-force search of correlation bounds for polynomials. (English)
Electron. Colloq. Comput. Complex. 18, 39 (2011).
59
On the query complexity for showing dense model. (English)
Electron. Colloq. Comput. Complex. 18, 38 (2011).
60
Result 41 to 60 of 1569 total
Start
Contact
Print
General Help
