3208 search results - page 182 / 642 » A Lower Bound for Primality |
158
click to vote
COCO
2003
Springer
15 years 11 months ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
202
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
147
click to vote
ARITH
1999
IEEE
15 years 10 months ago
1999
IEEE
Quotients, reciprocals, square roots and square root reciprocals all have the property that infinitely precise
169
click to vote
SIROCCO
2007
15 years 8 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
165
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...