341 search results - page 58 / 69 » Quantum Computation and Lattice Problems |
CAV
2006
Springer
13 years 11 months ago
2006
Springer
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
ASIACRYPT
2000
Springer
14 years 12 hour ago
2000
Springer
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
ISHPC
1999
Springer
13 years 12 months ago
1999
Springer
Computer security is of growing importance in the increasingly networked computing environment.This work examines the issue of high-performance network security, specifically int...
NIPS
2000
13 years 9 months ago
2000
Learning of a smooth but nonparametric probability density can be regularized using methods of Quantum Field Theory. We implement a field theoretic prior numerically, test its eff...