249 search results - page 10 / 50 » One Complexity Theorist's View of Quantum Computing |
127
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
108
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
Designers of information visualization systems have the choice to present information in a single integrated view or in multiple views. In practice, there is a continuum between t...
114
click to vote
ICDT
2005
ACM
15 years 9 months ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
134
click to vote
FOCS
1999
IEEE
15 years 8 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
143
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...