Author:
Goliaei Sama,Jalili Saeed
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the third annual ACM symposium on Theory of computing, Shaker Heights, Ohio, United States, pp. 151–158. ACM, New York (1971)
2. Rintanen, J., Heljanko, K., Niemel, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12-13), 1031–1080 (2006)
3. Lecture Notes in Computer Science;N. Amla,2005
4. Oltean, M., Muntean, O.: Exact cover with light. 0708.1962 (August 2007). In: New Generation Computing, vol. 26(4), pp. 327–344. Springer, Heidelberg (2008)
5. Oltean, M.: Solving the hamiltonian path problem with a light-based computer. Natural Computing: an international journal 7(1), 57–70 (2008)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献