Result 121 to 140 of 1569 total
List decoding tensor products and interleaved codes. (English)
Electron. Colloq. Comput. Complex. 15, No. 105 (2008).
121
Optimal proof systems and complete languages. (English)
Electron. Colloq. Comput. Complex. 15, No. 107 (2008).
122
The power of unentanglement. (English)
Electron. Colloq. Comput. Complex. 15, No. 051 (2008).
123
A note on the distance to monotonicity of Boolean functions. (English)
Electron. Colloq. Comput. Complex. 15, No. 012 (2008).
124
On proximity oblivious testing. (English)
Electron. Colloq. Comput. Complex. 15, No. 041 (2008).
125
The sign-rank of AC^0. (English)
Electron. Colloq. Comput. Complex. 15, No. 016 (2008).
126
2-transitivity is insufficient for local testability. (English)
Electron. Colloq. Comput. Complex. 15, No. 033 (2008).
127
A simple proof of bazzi’s theorem. (English)
Electron. Colloq. Comput. Complex. 15, No. 081 (2008).
128
Kernels for the dominating set problem on graphs with an excluded minor. (English)
Electron. Colloq. Comput. Complex. 15, No. 066 (2008).
129
New results on noncommutative and commutative polynomial identity testing. (English)
Electron. Colloq. Comput. Complex. 15, No. 025 (2008).
130
Elusive functions and lower bounds for arithmetic circuits. (English)
Electron. Colloq. Comput. Complex. 15, No. 001 (2008).
131
A quantum time-space lower bound for the counting hierarchy. (English)
Electron. Colloq. Comput. Complex. 15, No. 017 (2008).
132
Solvency games. (English)
Electron. Colloq. Comput. Complex. 15, No. 089 (2008).
133
On the OBDD complexity of the most significant bit of integer multiplication. (English)
Electron. Colloq. Comput. Complex. 15, No. 056 (2008).
134
Multiparty communication complexity of disjointness. (English)
Electron. Colloq. Comput. Complex. 15, No. 002 (2008).
135
Arithmetic circuits: A chasm at depth four. (English)
Electron. Colloq. Comput. Complex. 15, No. 062 (2008).
136
Multitask efficiencies in the decision tree model. (English)
Electron. Colloq. Comput. Complex. 15, No. 096 (2008).
137
On the efficiency of non-uniform PCPP verifiers. (English)
Electron. Colloq. Comput. Complex. 15, No. 064 (2008).
138
On the computation of Boolean functions by quantum branching programs via fingerprinting. (English)
Electron. Colloq. Comput. Complex. 15, No. 059 (2008).
139
Concatenated codes can achieve list-decoding capacity. (English)
Electron. Colloq. Comput. Complex. 15, No. 054 (2008).
140
Result 121 to 140 of 1569 total