Volume 13, Issue 3-4 | computational complexity

Search all computational complexity articles

Volume 13, Issue 3-4

February 2005

Filter by

Volume:

Sort by

Date published:

New to old Old to new

3 articles in this issue

On the complexity of computing determinants
Erich Kaltofen
Gilles Villard
Original Paper Pages: 91 - 130
Valiant’s model and the cost of computing integers
Pascal Koiran
Original Paper Pages: 131 - 146
The complexity of constructing pseudorandom generators from hard functions
Emanuele Viola
Original Paper Pages: 147 - 188