|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
11 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | Approximating the SVP to within a Factor (1+1/dimε) Is NP-Hard under Randomized Reductions |
Cai, Jin-Yi |
1999 |
59 | 2 |
p. 221-239 19 p. |
article |
|
| 2 | Arthur–Merlin Games in Boolean Decision Trees |
Raz, Ran |
1999 |
59 | 2 |
p. 346-372 27 p. |
article |
|
| 3 | Complexity Limitations on Quantum Computation |
Fortnow, Lance |
1999 |
59 | 2 |
p. 240-252 13 p. |
article |
|
| 4 | Computational Indistinguishability: A Sample Hierarchy |
Goldreich, Oded |
1999 |
59 | 2 |
p. 253-269 17 p. |
article |
|
| 5 | GUEST EDITORS' FOREWORD |
Feigenbaum, Joan |
1999 |
59 | 2 |
p. 163- 1 p. |
article |
|
| 6 | Hard Sets Are Hard to Find |
Buhrman, Harry |
1999 |
59 | 2 |
p. 327-345 19 p. |
article |
|
| 7 | Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds |
Allender, Eric |
1999 |
59 | 2 |
p. 164-181 18 p. |
article |
|
| 8 | On Arithmetic Branching Programs |
Beimel, Amos |
1999 |
59 | 2 |
p. 195-220 26 p. |
article |
|
| 9 | On Membership Comparable Sets |
Sivakumar, D. |
1999 |
59 | 2 |
p. 270-280 11 p. |
article |
|
| 10 | Space-Bounded Quantum Complexity |
Watrous, John |
1999 |
59 | 2 |
p. 281-326 46 p. |
article |
|
| 11 | Two Queries |
Buhrman, Harry |
1999 |
59 | 2 |
p. 182-194 13 p. |
article |
11 results found