Author:
Duchier Denys,Durand-Lose Jérôme,Senot Maxime
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Lecture Notes in Computer Science;E. Asarin,1995
2. Lecture Notes in Computer Science;O. Bournez,1997
3. Brun, T.A.: Computers with closed timelike curves can solve hard problems efficiently. Foundations of Physics Letters 16, 245–253 (2003)
4. Cook, S.A.: The complexity of theorem proving procedures. In: 3rd Symposium on Theory of Computing (STOC 1971), pp. 151–158. ACM, New York (1971)
5. Duchier, D., Durand-Lose, J., Senot, M.: Fractal parallelism: solving SAT in bounded space and time (extended version). Research Report RR-2010-08, LIFO, Université d’Orléans (2010), http://www.univ-orleans.fr/lifo/rapports.php
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献