106 search results - page 10 / 22 » Proving Lower Bounds Via Pseudo-random Generators |
EUROCRYPT
2003
Springer
14 years 21 days ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic one-counter automata (wit...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
FOCS
2008
IEEE
14 years 1 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...
ICLP
1999
Springer
13 years 11 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...