## The Computational Complexity Column (1998)

### Cached

### Download Links

- [www.cps.unizar.es]
- [webdiis.unizar.es]
- [ftp.cs.rutgers.edu]
- [ftp.cs.rutgers.edu]
- DBLP

### Other Repositories/Bibliography

### BibTeX

@MISC{Rutgers98thecomputational,

author = {Eric Allender Rutgers and Eric Allender and Jack H. Lutz and Elvira Mayordomo},

title = {The Computational Complexity Column},

year = {1998}

}

### OpenURL

### Abstract

Introduction Investigation of the measure-theoretic structure of complexity classes began with the development of resource-bounded measure in 1991 [56]. Since that time, a growing body of research by more than forty scientists around the world has shown resource-bounded measure to be a powerful tool that sheds new light on many aspects of computational complexity. Recent survey papers by Lutz [60], Ambos-Spies and Mayordomo [3], and Buhrman and Torenvliet [22] describe many of the achievements of this line of inquiry. In this column, we give a more recent snapshot of resource-bounded measure, focusing not so much on what has been achieved to date as on what we hope will be achieved in the near future. Section 2 below gives a brief, nontechnical overview of resource-bounded measure in terms of its motivation and principal ideas. Sections 3, 4, and 5 describe twelve specific open problems in the area. We have used the following three criteria in choosing these problems. 1. Their