Properties of NP-Complete Sets

Authors:
Christian Glaser;A. Pavan;Alan L. Selman;Samik Sengupta
Affiliations:
Universität Würzburg;Iowa State University;University at Buffalo;University at Buffalo
Venue:
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Year:
2004

Citing 0
Cited 3

Robustness of PSPACE-complete sets

Information Processing Letters
Autoreducibility, mitoticity, and immunity

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Hardness hypotheses, derandomization, and circuit complexity

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the compression of polynomially samplablesources. In particular, we give efficientprefix-free compression and decompression algorithmsfor three classes of such sources (whosesupport is a subset of {0, 1}^n).1. We show how to compress sources ...