406 search results - page 5 / 82 » Pseudorandomness and Combinatorial Constructions |
156
click to vote
FOCS
2008
IEEE
16 years 14 days 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...
101
click to vote
LOGCOM
2007
15 years 5 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.
184
click to vote
CCS
2009
ACM
15 years 3 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...