Sciweavers

247 search results - page 49 / 50
» On Pseudorandom Generators in NC
Sort
View
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 10 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
FOCS
1989
IEEE
13 years 10 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
CCS
2001
ACM
13 years 10 months ago
Efficient State Updates for Key Management
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed ...
Benny Pinkas
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