Author:
Ivanyos Gábor,Santha Miklos
Publisher
Springer International Publishing
Reference26 articles.
1. Ajtai, M.: Generating hard instances of lattice problems. In: 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 99–108 (1996)
2. Bacon, D., Childs, A.M., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 469–478 (2005)
3. Chevalley, C.: Démonstration d’une hypothèse de M. Artin. Abh. Math. Sem. Hamburg 11, 73–75 (1936)
4. Childs, A.M., Schulman, L., Vazirani, U.: Quantum algorithms for hidden nonlinear structures. In: 48th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 395–404 (2007)
5. Decker, T., Draisma, J., Wocjan, P.: Quantum algorithm for identifying hidden polynomial function graphs. Quantum Inf. Comput. 9, 0215–0230 (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献