397 search results - page 17 / 80 » Pseudorandom Functions and Lattices |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
78
Voted
ITC
1996
IEEE
15 years 1 months ago
1996
IEEE
This paper presents a low-overhead scheme for built-in self-test of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
91
Voted
ECCC
2010
14 years 9 months ago
2010
![Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/pseudorandom_generators_for_cc0_p_and_the_fourier_spectrum_of_low_degree_polynomials_over_finite_fields_ECCC_2010.jpg "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...
55
Voted
DM
1999
14 years 9 months ago
1999
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...