1369 search results - page 56 / 274 » Lattice computations for random numbers |
STACS
1999
Springer
14 years 1 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
FOCS
1990
IEEE
14 years 28 days ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
BROADNETS
2005
IEEE
13 years 11 months ago
2005
IEEE
— We present a game-theoretical model of a wireless communication system with multiple competing users sharing a multiaccess fading channel. With a specified capture rule and a ...
STOC
2003
ACM
14 years 9 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...