|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A Lower Bound for the Shortest Path Problem |
Mulmuley, Ketan |
2001 |
63 | 2 |
p. 253-267 15 p. |
article |
|
| 2 | Branching Program Size Is Almost Linear in Formula Size |
Giel, Oliver |
2001 |
63 | 2 |
p. 222-235 14 p. |
article |
|
| 3 | Easiness Assumptions and Hardness Tests: Trading Time for Zero Error |
Kabanets, Valentine |
2001 |
63 | 2 |
p. 236-252 17 p. |
article |
|
| 4 | GUEST EDITOR'S FOREWORD |
Pudlák, Pavel |
2001 |
63 | 2 |
p. 147- 1 p. |
article |
|
| 5 | Integer Circuit Evaluation Is PSPACE-Complete |
Yang, Ke |
2001 |
63 | 2 |
p. 288-303 16 p. |
article |
|
| 6 | On the Complexity of Some Problems on Groups Input as Multiplication Tables |
Barrington, David Mix |
2001 |
63 | 2 |
p. 186-200 15 p. |
article |
|
| 7 | Papers to Appear in Forthcoming Issues |
2001 |
63 | 2 |
p. 304- 1 p. |
article |
||
| 8 | Quantum Kolmogorov Complexity |
Berthiaume, André |
2001 |
63 | 2 |
p. 201-221 21 p. |
article |
|
| 9 | The Communication Complexity of Enumeration, Elimination, and Selection |
Ambainis, Andris |
2001 |
63 | 2 |
p. 148-185 38 p. |
article |
|
| 10 | Time–Space Tradeoffs for SAT on Nonuniform Machines |
Tourlakis, Iannis |
2001 |
63 | 2 |
p. 268-287 20 p. |
article |
10 results found