131 search results - page 14 / 27 » The complexity of constructing pseudorandom generators from ... |
STACS
2012
Springer
12 years 3 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
ATAL
2004
Springer
14 years 1 months ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
ICCSA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. The design and management of firewall ACLs is a very hard and error-prone task. Part of this complexity comes from the fact that each firewall platform has its own low-le...
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...