Author:
Lorenz Jan-Hendrik,Schöning Uwe
Publisher
Springer International Publishing
Reference11 articles.
1. Even, S., Selman, A.L., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Inf. Control 61(2), 159–173 (1984)
2. Lecture Notes in Computer Science;O Goldreich,2006
3. Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: National Conference on Artificial Intelligence, pp. 431–437. AAAI Press (1998)
4. Ko, K.: Complexity Theory of Real Functions. Birkhäuser, Boston (1991)
5. Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem - Its Structural Complexity. Birkhäuser, Boston (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Restart Strategies in a Continuous Setting;Theory of Computing Systems;2021-05-05