You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
| Chapter title |
6. The Size of Randomized Polynomial Time
|
|---|---|
| Chapter number | 6 |
| Book title |
Randomness and Completeness in Computational Complexity
|
| Published by |
Springer, Berlin, Heidelberg, January 2000
|
| DOI | 10.1007/3-540-44545-5_6 |
| Book ISBNs |
978-3-54-041492-6, 978-3-54-044545-6
|
| Authors |
Dieter van Melkebeek |