History
1
so:se00006459
1569


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 121 141 161 181 201 | next | last

Result 101 to 120 of 1569 total

Quantum query complexity of multilinear identity testing. (English)
Electron. Colloq. Comput. Complex. 15, No. 086 (2008).
WorldCat.org
101
PDF XML AMS-TeX TEXT BIBTeX URL
Kolmogorov complexity and combinatorial methods in communication complexity. (English)
Electron. Colloq. Comput. Complex. 15, No. 109 (2008).
WorldCat.org
102
PDF XML AMS-TeX TEXT BIBTeX URL
Cryptographic complexity of multi-party computation problems: Classifications and separations. (English)
Electron. Colloq. Comput. Complex. 15, No. 050 (2008).
WorldCat.org
103
PDF XML AMS-TeX TEXT BIBTeX URL
Property testing of equivalence under a permutation group action. (English)
Electron. Colloq. Comput. Complex. 15, No. 040 (2008).
WorldCat.org
104
PDF XML AMS-TeX TEXT BIBTeX URL
A simple constant-probability RP reduction from NP to parity P. (English)
Electron. Colloq. Comput. Complex. 15, No. 093 (2008).
WorldCat.org
105
PDF XML AMS-TeX TEXT BIBTeX URL
Deterministic extractors for algebraic sources. (English)
Electron. Colloq. Comput. Complex. 15, No. 042 (2008).
WorldCat.org
106
PDF XML AMS-TeX TEXT BIBTeX URL
Structural complexity of avgbpp. (English)
Electron. Colloq. Comput. Complex. 15, No. 073 (2008).
WorldCat.org
107
PDF XML AMS-TeX TEXT BIBTeX URL
On iterated dominance, matrix elimination, and matched paths. (English)
Electron. Colloq. Comput. Complex. 15, No. 077 (2008).
WorldCat.org
108
PDF XML AMS-TeX TEXT BIBTeX URL
Constraint satisfaction over a non-Boolean domain: Approximation algorithms and unique-games hardness. (English)
Electron. Colloq. Comput. Complex. 15, No. 008 (2008).
WorldCat.org
109
PDF XML AMS-TeX TEXT BIBTeX URL
NP-hard sets are exponentially dense unless NP is contained in conp/poly. (English)
Electron. Colloq. Comput. Complex. 15, No. 022 (2008).
WorldCat.org
110
PDF XML AMS-TeX TEXT BIBTeX URL
A hypergraph dictatorship test with perfect completeness. (English)
Electron. Colloq. Comput. Complex. 15, No. 098 (2008).
WorldCat.org
111
PDF XML AMS-TeX TEXT BIBTeX URL
Derandomizing the isolation lemma and lower bounds for noncommutative circuit size. (English)
Electron. Colloq. Comput. Complex. 15, No. 049 (2008).
WorldCat.org
112
PDF XML AMS-TeX TEXT BIBTeX URL
A computational theory of awareness and decision making. (English)
Electron. Colloq. Comput. Complex. 15, No. 046 (2008).
WorldCat.org
113
PDF XML AMS-TeX TEXT BIBTeX URL
Worst case to average case reductions for polynomials. (English)
Electron. Colloq. Comput. Complex. 15, No. 072 (2008).
WorldCat.org
114
PDF XML AMS-TeX TEXT BIBTeX URL
The complexity of rationalizing matchings. (English)
Electron. Colloq. Comput. Complex. 15, No. 021 (2008).
WorldCat.org
115
PDF XML AMS-TeX TEXT BIBTeX URL
Two query PCP with sub-constant error. (English)
Electron. Colloq. Comput. Complex. 15, No. 071 (2008).
WorldCat.org
116
PDF XML AMS-TeX TEXT BIBTeX URL
Finding significant Fourier transform coefficients deterministically and locally. (English)
Electron. Colloq. Comput. Complex. 15, No. 102 (2008).
WorldCat.org
117
PDF XML AMS-TeX TEXT BIBTeX URL
Multiparty communication complexity of AC^0. (English)
Electron. Colloq. Comput. Complex. 15, No. 061 (2008).
WorldCat.org
118
PDF XML AMS-TeX TEXT BIBTeX URL
Closed timelike curves make quantum and classical computing equivalent. (English)
Electron. Colloq. Comput. Complex. 15, No. 092 (2008).
WorldCat.org
119
PDF XML AMS-TeX TEXT BIBTeX URL
Multiparty communication complexity and threshold circuit size of AC^0. (English)
Electron. Colloq. Comput. Complex. 15, No. 082 (2008).
WorldCat.org
120
PDF XML AMS-TeX TEXT BIBTeX URL
first | previous | 1 21 41 61 81 101 121 141 161 181 201 | next | last

Result 101 to 120 of 1569 total

Valid XHTML 1.0 Transitional Valid CSS!