This is page 1 Printer: Opaque this Sparse Sets versus Complexity Classes
Download:
|
|
by Jin-yi Cai, Mitsunori Ogihara
ftp://ftp.cs.buffalo.edu/pub/tech-reports/./95-41.ps.Z
Add To MetaCart
Abstract:
ABSTRACT The study of sparse hard sets and sparse complete sets has been a central research area in complexity theory for nearly two decades. Recently new results using unexpected techniques have been obtained. They provide new and easier proofs of old theorems, proofs of new theorems that unify previously known results, resolutions of old conjectures, and connections to the fascinating world of randomization and derandomization. In this article we give an exposition of this vibrant research area. 1
Citations
| 164 | Structural Complexity I – Balc'azar, D'iaz, et al. - 1988 |
| 111 | Sorting in c log n parallel steps – Ajtai, Koml'os, et al. - 1983 |
| 20 | Relationship between density and deterministic complexity of NP-complete languages – Berman - 1978 |
| 18 | On bounded truth-table, conjunctive, and randomized reductions to sparse sets – Arvind, Kobler, et al. - 1992 |
| 4 | Lowness and the complexity of sparse and tally descriptions – Arvind, Kobler, et al. - 1992 |
| 3 | Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets – Agrawal, Arvind - 1995 |
