Sciweavers

290 search results - page 4 / 58
» Pseudorandom Bits for Polynomials
Sort
View
VTS
1998
IEEE
88views Hardware» more  VTS 1998»
14 years 2 months ago
Transition Maximization Techniques for Enhancing the Two-Pattern Fault Coverage of Pseudorandom Test Pattern Generators
This paper presents simulation evidence supporting the use of bit transition maximization techniques in the design of hardware test pattern generators TPGs. Bit transition maximiz...
Bruce F. Cockburn, Albert L.-C. Kwong
APPROX
2009
Springer
87views Algorithms» more  APPROX 2009»
14 years 4 months ago
Pseudorandom Bit Generators That Fool Modular Sums
Shachar Lovett, Omer Reingold, Luca Trevisan, Sali...
ASYNC
2007
IEEE
111views Hardware» more  ASYNC 2007»
14 years 4 months ago
A Configurable Asynchronous Pseudorandom Bit Sequence Generator
Alex Chow, William S. Coates, David Hopkins
ECCC
2010
104views more  ECCC 2010»
13 years 9 months ago
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka