A moment of perfect clarity I: the parallel census technique

Authors:
Lane A. Hemaspaandra;Christian Glaßer
Affiliations:
-;-
Venue:
ACM SIGACT News
Year:
2000

Citing 0
Cited 3

A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions

ACM SIGACT News
Lower bounds and the hardness of counting properties

Theoretical Computer Science
Cluster computing and the power of edge recognition

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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 [GH] will discuss advances (including [CNS95] and Glaßer [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.