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.
/lp/association-for-computing-machinery/a-moment-of-perfect-clarity-i-the-parallel-census-technique-vF8Z0CmyGz