Computer Science – Computational Complexity
Scientific paper
2000-11-16
Computer Science
Computational Complexity
20 pages, 1 table
Scientific paper
This paper discusses advances, due to the work of Cai, Naik, and Sivakumar
and Glasser, 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 II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions 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 II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-447040