A Moment of Perfect Clarity I: The Parallel Census Technique
Christian Glasser, Lane A. Hemaspaandra
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.
Create a lesson
Related papers
How far is Kolmogorov-Loveland randomness from Martin-Löf randomness?
Tomislav Petrović
The Complexity of Finding Additional Solutions
Saman Farhat
On the Hardness of 4-to-1 Games with Perfect Completeness
Yumou Fei, Dor Minzer, Shuo Wang
Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation
Sebastian Ben Daniel
∃ R ⊂eq CH
Alex Meiburg
Primal/Dual Method for the Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta