A highly scalable solution of an np-complete problem using CUDA

Proceedings - 6th International Symposium on Parallel Computing in Electrical Engineering, PARELEC 2011

Volumn , Issue , 2011, Pages 93-98

  Islam, Saiyedul ^a   Tandon, Raghav ^a   Singh, Shashank ^a   Misra, Alok ^a  

^a DR A P J ABDUL KALAM TECHNICAL UNIVERSITY   (India)

Author keywords

CUDA; GPU; NP Complete problems; Parallel Processing; SAT; Scalability

Indexed keywords

CUDA; GPU; NP COMPLETE PROBLEMS; PARALLEL PROCESSING; SAT;

BOOLEAN FUNCTIONS; ELECTRICAL ENGINEERING; GERMANIUM; PARALLEL ARCHITECTURES; POLYNOMIAL APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 79958721644     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PARELEC.2011.12     Document Type: Conference Paper

References (12)

1. S.A. Cook, "The complexity of theorem-proving procedures", Conference Record of the Third Annual ACM Symposium on the Theory of Computing, pp. 151-158, 1971.
2. M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem proving", CACM, 5:394-397, 1962.
3. Bart Selman, Henry Kautz, and Bram Cohen, "Local search strategies for satisfiability testing", In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 521-532, 1995.
4. B. Selman, H. Levesque, and D. Mitchell, "A New Method for Solving Hard Satisfiability Problems", Proc. of AAA'92, MIT Press, 440-446, 1992. (Pubitemid 23633551)
5. R. Reiter, and A. Mackworth, "A logical framework for depiction and image interpretation", Artificial Intelligence 41(2), 1989, pp.125-155. (Pubitemid 20633176)
6. R. Reiter, "A theory of diagnosis from first principles", Artificial Intelligence32(1), 1987, pp.57-95.
7. NVIDIA CUDA Programming Guide, version 2.3: http://developer.download. nvidia.com/compute/cuda/2-3/toolkit/docs/NVIDIA-CUDA-Programming-Guide-2.3.pdf
8. Olivier Dubois, SAT generator contributed to DIMACS Second Implementation Challenge: ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/contributed/ dubois/
9. Kazuo Iwama, Eiji Miyano and Yuichi Asahiro, SAT generator contributed to DIMACS Second Implementation Challenge: ftp://dimacs.rutgers.edu/pub/challenge/ satisfiability/contributed/iwama/
10. D. pretolani, SAT generator contributed to DIMACS Second Implementation Challenge: ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/contributed/ pretolani/
11. DIMACS, "Satisfibaility Suggested Format", 1993: http://people.sc.fsu.edu/~jburkardt/pdf/dimacs-cnf.pdf
12. R. M Karp, "Reducibility Among Combinatorial Problems", Complexity of Computer Computations (1972), pp.85-103.