A Moment of Perfect Clarity I: The Parallel Census Technique
Computational Complexity
2007-05-23 v1
Abstract
We discuss the history and uses of the parallel census technique---an elegant tool in the study of certain computational objects having polynomially bounded census functions. A sequel will discuss advances (including Cai, Naik, and Sivakumar [CNS95] and Glasser [Gla00]), some related to the parallel census technique and some due to other approaches, in the complexity-class collapses that follow if NP has sparse hard sets under reductions weaker than (full) truth-table reductions.
Keywords
Cite
@article{arxiv.cs/0007025,
title = {A Moment of Perfect Clarity I: The Parallel Census Technique},
author = {Christian Glasser and Lane A. Hemaspaandra},
journal= {arXiv preprint arXiv:cs/0007025},
year = {2007}
}
Comments
8 pages