EASY UNDERSTANDING OF COMPUTATIONAL COMPLEXITY THEORY – A STUDENT’S PERSPECTIVE
| العنوان: | EASY UNDERSTANDING OF COMPUTATIONAL COMPLEXITY THEORY – A STUDENT’S PERSPECTIVE |
|---|---|
| المؤلفون: | Bhalchandra Pu, Kulkarni Pp, Rawangaonkar Rr, Tammewar Pr, More Ul |
| المصدر: | International Journal of Machine Intelligence. 2:40-45 |
| بيانات النشر: | Bioinfo Publications, 2010. |
| سنة النشر: | 2010 |
| مصطلحات موضوعية: | Theoretical computer science, Computational complexity theory, Computer science, Simple (abstract algebra), Completeness (order theory), Perspective (graphical), Entry Level, Division (mathematics), Data structure, Algorithm, Analysis of algorithms |
| الوصف: | Computer Science is largely concerned about a single question - how long does it take to execute a given algorithm? But computer scientists don't give the answer in minutes or milliseconds; they give it relative to the number of elements the algorithm has to manipulate resulting into formation of computational complexity theory. For entry level students in Data Structures and Analysis of Algorithms, understanding this theory is quite hard as literature review seen so far is dedicated to classifying problems by how hard they are. We have attempted for rigorous analysis of literature review and discovered different types of problems. A division of problem space is suggested in order to put these concepts in simple and conceptually understandable format. Keywords - Complexity Theory, P, NP completeness |
| تدمد: | 0975-9166 0975-2927 |
| URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::13dbbb8f30ede5d26c879ee6e4864750 https://doi.org/10.9735/0975-2927.2.1.40-45 |
| حقوق: | OPEN |
| رقم الأكسشن: | edsair.doi...........13dbbb8f30ede5d26c879ee6e4864750 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 09759166 09752927 |
|---|