Result 81 to 100 of 1569 total
NEXP does not have non-uniform quasi-polynomial-size ACC circuits of $o(\log \log n)$ depth. (English)
Electron. Colloq. Comput. Complex. 18, 17 (2011).
81
Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification. (English)
Electron. Colloq. Comput. Complex. 18, 16 (2011).
82
Hardness and non-approximability of Bregman clustering problems. (English)
Electron. Colloq. Comput. Complex. 18, 15 (2011).
83
Towards an axiomatic system for Kolmogorov complexity. (English)
Electron. Colloq. Comput. Complex. 18, 14 (2011).
84
Sublinear time algorithms. (English)
Electron. Colloq. Comput. Complex. 18, 13 (2011).
85
Input locality and hardness amplification. (English)
Electron. Colloq. Comput. Complex. 18, 12 (2011).
86
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models. (English)
Electron. Colloq. Comput. Complex. 18, 11 (2011).
87
Tensor rank: some lower and upper bounds. (English)
Electron. Colloq. Comput. Complex. 18, 10 (2011).
88
Planarity testing revisited. (English)
Electron. Colloq. Comput. Complex. 18, 9 (2011).
89
Advice coins for classical and quantum computation. (English)
Electron. Colloq. Comput. Complex. 18, 8 (2011).
90
Pseudorandom generators with long stretch and low locality from random local one-way functions. (English)
Electron. Colloq. Comput. Complex. 18, 7 (2011).
91
Average-case separation in proof complexity: short propositional refutations for random 3CNF formulas. (English)
Electron. Colloq. Comput. Complex. 18, 6 (2011).
92
Testing linear properties: some general themes. (English)
Electron. Colloq. Comput. Complex. 18, 5 (2011).
93
On the complexity of computational problems regarding distributions (a survey). (English)
Electron. Colloq. Comput. Complex. 18, 4 (2011).
94
Constant-round zero-knowledge proofs of knowledge. (English)
Electron. Colloq. Comput. Complex. 18, 3 (2011).
95
On the degree of univariate polynomials over the integers. (English)
Electron. Colloq. Comput. Complex. 18, 2 (2011).
96
Impossibility of succinct quantum proofs for collision-freeness. (English)
Electron. Colloq. Comput. Complex. 18, 1 (2011).
97
Multivariate polynomial integration and derivative are polynomial time inapproximable unless P=NP. (English)
Electron. Colloq. Comput. Complex. 17, 202 (2010).
98
The shrinking property for NP and conp. (English)
Electron. Colloq. Comput. Complex. 15, No. 029 (2008).
99
Nondeterministic instance complexity and proof systems with advice. (English)
Electron. Colloq. Comput. Complex. 15, No. 075 (2008).
100
Result 81 to 100 of 1569 total
Start
Contact
Print
General Help
