Sciweavers

34 search results - page 7 / 7
» Pseudorandomness of SPN-Type Transformations
Sort
View
CSR
2011
Springer
12 years 9 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
ATS
1998
IEEE
170views Hardware» more  ATS 1998»
13 years 10 months ago
A Ring Architecture Strategy for BIST Test Pattern Generation
This paper presents a new effective Built-In Self Test (BIST) scheme that achieves 100% fault coverage with low area overhead, and without any modification of the circuit under tes...
Christophe Fagot, Olivier Gascuel, Patrick Girard,...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 18 days ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
TIT
2008
116views more  TIT 2008»
13 years 6 months ago
On the Complexity of Hardness Amplification
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu