Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
An improved lower bound for approximating Shortest Integer Relation in l∞ norm (SIR∞)
Information Processing Letters
New Hardness Results for Diophantine Approximation
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Using the inhomogeneous simultaneous approximation problem for cryptographic design
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Hi-index | 0.00 |