nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A bridging model for multi-core computing
|
Valiant, Leslie G. |
|
2011 |
77 |
1 |
p. 154-166 13 p. |
artikel |
2 |
Contents
|
|
|
2011 |
77 |
1 |
p. OBC- 1 p. |
artikel |
3 |
Deterministic extractors for small-space sources
|
Kamp, Jesse |
|
2011 |
77 |
1 |
p. 191-220 30 p. |
artikel |
4 |
Editorial Board
|
|
|
2011 |
77 |
1 |
p. IFC- 1 p. |
artikel |
5 |
Foreword
|
Cai, Jin-Yi |
|
2011 |
77 |
1 |
p. 1-2 2 p. |
artikel |
6 |
Hardness amplification within NP against deterministic algorithms
|
Gopalan, Parikshit |
|
2011 |
77 |
1 |
p. 107-121 15 p. |
artikel |
7 |
Hardness results for approximating the bandwidth
|
Dubey, Chandan |
|
2011 |
77 |
1 |
p. 62-90 29 p. |
artikel |
8 |
Heuristic algorithms in computational molecular biology
|
Karp, Richard M. |
|
2011 |
77 |
1 |
p. 122-128 7 p. |
artikel |
9 |
Holographic algorithms: From art to science
|
Cai, Jin-Yi |
|
2011 |
77 |
1 |
p. 41-61 21 p. |
artikel |
10 |
Infeasibility of instance compression and succinct PCPs for NP
|
Fortnow, Lance |
|
2011 |
77 |
1 |
p. 91-106 16 p. |
artikel |
11 |
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
|
Raz, Ran |
|
2011 |
77 |
1 |
p. 167-190 24 p. |
artikel |
12 |
On the hardness of learning intersections of two halfspaces
|
Khot, Subhash |
|
2011 |
77 |
1 |
p. 129-141 13 p. |
artikel |
13 |
The complexity of Boolean formula minimization
|
Buchfuhrer, David |
|
2011 |
77 |
1 |
p. 142-153 12 p. |
artikel |
14 |
The isomorphism conjecture for constant depth reductions
|
Agrawal, Manindra |
|
2011 |
77 |
1 |
p. 3-13 11 p. |
artikel |
15 |
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
|
Allender, Eric |
|
2011 |
77 |
1 |
p. 14-40 27 p. |
artikel |