Computer Science – Computational Complexity
Scientific paper
2000-07-13
Computer Science
Computational Complexity
8 pages
Scientific paper
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.
Glasser Christian
Hemaspaandra Lane A.
No associations
LandOfFree
A Moment of Perfect Clarity I: The Parallel Census Technique does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Moment of Perfect Clarity I: The Parallel Census Technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Moment of Perfect Clarity I: The Parallel Census Technique will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-15344