On Approximating the Entropy of Polynomial Mappings

13 years 4 months ago

Download www.cs.princeton.edu

We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite field, approximate the the output entropy H(p(Un)), where Un is the uniform distribution on Fn and H may be any of several entropy measures. We show:

Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P

Real-time Traffic

Algorithm | ECCC 2010 | Entropy | Polynomials |

claim paper

» Cooperative adaptive sampling via approximate entropy maximization

» A Phase Space Approach to Minimax Entropy Learning and the Minutemax Approximations

» Raw Image Encoding Based on Polynomial Approximation

» Towards Practical MinimumEntropy Universal Decoding

» Approximation Algorithm for Process Mapping on Network Processor Architectures

» Approximate analysis of blocking queueing networks with temporal dependence

» Networks of polynomial pieces with application to the analysis of point clouds and images

» Fast Molecular Shape Matching Using Contact Maps

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ECCC
Authors	Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan

Comments (0)

Sciweavers

On Approximating the Entropy of Polynomial Mappings

Algorithm | ECCC 2010 | Entropy | Polynomials |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers