Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Leonard Adleman. Molecular computation of solutions to combinatorial problems. Science, 1994, vol. 266, p. 1021–1024.
2. Andris Ambainis and RŪsiņš Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. 39th FOCS, 1998 http://xxx.lanl.gov/abs/quant-ph/9802062
3. N. C. Ankeny. The least quadratic non residue. Annals of Mathematics, 1952, vol. 55, p. 65–72.
4. Eric Bach. Fast algorithms under the Extended Riemann Hypothesis: a concrete estimate. Proc. 14th STOC, 1982, p. 290–295.
5. Eric Bach. Realistic analysis of some randomized algorithms. Journal of Computer and System Sciences, 1991, vol. 42, No. 1, p. 30–53.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic Information Theory and Computational Complexity;Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence;2013
2. Frequency Prediction of Functions;Mathematical and Engineering Methods in Computer Science;2012