Special issue, final part “Conference on Computational Complexity 2004 ” Guest Editor’s foreword Eric AllenderGuest Editor Foreword Open access Pages: 185 - 185
Compression of Samplable Sources Luca TrevisanSalil VadhanDavid Zuckerman Original Paper Open access Pages: 186 - 227
Language compression and pseudorandom generators Harry BuhrmanTroy LeeDieter van Melkebeek Original Paper Open access Pages: 228 - 255
Derandomizing Arthur–Merlin Games using Hitting Sets Peter Bro MiltersenN. V. Vinodchandran Original Paper Open access Pages: 256 - 279