406 search results - page 5 / 82 » Pseudorandomness and Combinatorial Constructions |
COCO
2005
Springer
14 years 4 months ago
2005
Springer
FOCS
1996
IEEE
14 years 3 months ago
1996
IEEE
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
LOGCOM
2007
13 years 10 months ago
2007
We define a notion of combinatorial labellings, and show that ∆0 2 is the largest boldface pointclass in which every set admits a combinatorial labelling.
CCS
2009
ACM
13 years 8 months ago
2009
ACM
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...