The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
type: Item
instance of: scholarly article
title: The sum of \(D\) small-bias generators fools polynomials of degree \(D\)
zbMATH Open document ID: 1217.68157
author: Emanuele Viola
published in: Computational Complexity
publication date: 2011-02-18T00:00:00Z
Mathematics Subject Classification ID: 68Q99
zbMATH DE Number: 5853231
zbMATH Keywords: pseudorandom generators
zbMATH Keywords: small-bias generators
MaRDI profile type: Publication
full work available at URL: s00037-009-0273-5
OpenAlex ID: W2125212199
DOI: 10.1007/S00037-009-0273-5
Recommended article: Q3083191
Recommended article: Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields
Recommended article: Pseudorandom generators for low degree polynomials
Recommended article: Linear complexity of pseudorandom sequences based on summation of polynomial quotients
Recommended article: On the pseudorandomness of the Liouville function of polynomials over a finite field
Recommended article: Q3002801
Recommended article: Q5302079
Recommended article: Small Sample Spaces Cannot Fool Low Degree Polynomials
Recommended article: Q4035673
Recommended article: Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation)
description: scientific article; zbMATH DE number 5853231