|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 5 van 12 gevonden artikelen
| Titel: |
Easy understanding of computational complexity theory – a student’s perspective |
| Auteur: |
Bhalchandra P.U. More U. L. Rawangaonkar R. R. Tammewar P. R. Kulkarni P.P. |
| Verschenen in: |
International journal of machine intelligence |
| Paginering: | Jaargang 2 (2010) nr. 1 pagina's 40-45 |
| Jaar: |
2010 |
| Inhoud: |
Computer Science is largely concerned about a single question - how long does it take to executea given algorithm? But computer scientists don’t give the answer in minutes or milliseconds; they give itrelative to the number of elements the algorithm has to manipulate resulting into formation of computationalcomplexity theory. For entry level students in Data Structures and Analysis of Algorithms, understanding thistheory is quite hard as literature review seen so far is dedicated to classifying problems by how hard theyare. 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 conceptuallyunderstandable format. |
| Uitgever: |
Bioinfo Publications (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 5 van 12 gevonden artikelen
| << vorige | volgende >> |