Polynomials That Sign Represent Parity and Descartes Rule of Signs

Authors:
Saugata Basu;Nayantara Bhatnagar;Parikshit Gopalan;Richard J. Lipton
Affiliations:
Georgia Tech;Georgia Tech;Georgia Tech;Georgia Tech
Venue:
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Year:
2004

Citing 0
Cited 1

On the complexity of depth-2 circuits with threshold gates

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.01

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 ...