Thursday 28th of March 2024
 

Hardware Designation For Scaling P=NP Problem


Md. Yasin Ali Khan and Md. Abu Sayed

One of the fundamental question of computer science P=NP that is intuitively interlinked with many theoretical issues. In this paper we search for an algorithm or Turing machine equivalent that is reasonably sufficient to cope with this deep problem. Some hardware assistance may enable us to get better solution in this respect. In general weve shown some analogy that can deal with non-determinism effectively and hope to find some analogical transformation that will help making more powerful solid state computing device.

Keywords: travelling salesman problem ,P=NP , algorithm, turing machine, nondeterministic sorting.

Download Full-Text


ABOUT THE AUTHORS

Md. Yasin Ali Khan
Student of B.Sc in Computer Science and Engineering, Chittagong University of Engineering and Technology. Live in Bangladesh.

Md. Abu Sayed
Student of B.Sc in Computer Science and Engineering, American International University-Bangladesh. Live in Bangladesh.


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »