Sciweavers

3257 search results - page 155 / 652
» Some Results on Effective Randomness
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
16 years 1 months ago
One-Way Functions and the Berman-Hartmanis Conjecture
—The Berman-Hartmanis conjecture states that all NP-complete sets are P-isomorphic each other. On this conjecture, we first improve the result of [3] and show that all NP-comple...
Manindra Agrawal, Osamu Watanabe
EPEW
2005
Springer
16 years 22 hour ago
Zero-Automatic Queues
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infini...
Thu-Ha Dao-Thi, Jean Mairesse
OR
2005
Springer
15 years 12 months ago
Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application
In the open route version of the well-known vehicle routing problem, vehicles are not required to return to the depot; or if they are required, then they return by traveling the sa...
Zeynep Özyurt, Deniz Aksen, Necati Aras
SCCC
2002
IEEE
15 years 11 months ago
On the Distribution of Keys by Hashing
The distribution of keys by a hash function as used in hash search with chaining is studied by considering the distribution of keys a random function from keys to buckets would gi...
Horst H. von Brand
CRYPTO
2000
Springer
133views Cryptology» more  CRYPTO 2000»
15 years 10 months ago
Provably Secure Partially Blind Signatures
Partially blind signature schemes are an extension of blind signature schemes that allow a signer to explicitly include necessary information (expiration date, collateral condition...
Masayuki Abe, Tatsuaki Okamoto