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

Authors:
Christian Glaßer;Lane A. Hemaspaandra
Affiliations:
-;Dept. of Computer Science, University of Rochester, Rochester, NY
Venue:
ACM SIGACT News
Year:
2000

Citing 8
Cited 2

NP is as easy as detecting unique solutions

Theoretical Computer Science
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets

SIAM Journal on Computing
How reductions to sparse sets collapse the polynomial-time hierarchy: a primer; part I: polynomial-time Turing reductions

ACM SIGACT News
Reductions to sets of low information content

Complexity theory
Sparse sets versus complexity classes

Complexity theory retrospective II
New Collapse Consequences of NP Having Small Circuits

SIAM Journal on Computing
A moment of perfect clarity I: the parallel census technique

ACM SIGACT News
Six Hypotheses in Search of a Theorem

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity

Introduction

ACM SIGACT News
SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms

ACM SIGACT News

Quantified Score

Hi-index	0.01

Visualization

Abstract

This issue's column, Part II of the article started in the preceding issue, is about progress on the question of whether NP has sparse hard sets with respect to weak reductions.Upcoming Complexity Theory Column articles include A. Werschulz on information-based complexity; J. Castro, R. Gavaldà, and D. Guijarro on what complexity theorists can learn from learning theory; S. Ravi Kumar and D. Sivakumar on a to-be-announced topic; M. Holzer and P. McKenzie on alternating stack machines; and R. Paturi on the complexity of k-SAT.