Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Worst-case_complexity> ?p ?o }
Showing triples 1 to 40 of
40
with 100 triples per page.
- Worst-case_complexity abstract "In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an algorithm requires in the worst-case. It gives an upper bound on the resources required by the algorithm.In the case of running time, the worst-case time-complexity indicates the longest running time performed by an algorithm given any input of size n, and thus this guarantees that the algorithm finishes on time. Moreover, the order of growth of the worst-case complexity is used to compare the efficiency of two algorithms.The worst-case complexity of an algorithm should be contrasted with its average-case complexity, which is an average measure of the amount of resources the algorithm uses on a random input.".
- Worst-case_complexity wikiPageID "20491989".
- Worst-case_complexity wikiPageLength "2388".
- Worst-case_complexity wikiPageOutDegree "13".
- Worst-case_complexity wikiPageRevisionID "534654881".
- Worst-case_complexity wikiPageWikiLink Analysis_of_algorithms.
- Worst-case_complexity wikiPageWikiLink Average-case_complexity.
- Worst-case_complexity wikiPageWikiLink Big_O_notation.
- Worst-case_complexity wikiPageWikiLink Category:Analysis_of_algorithms.
- Worst-case_complexity wikiPageWikiLink Charles_E._Leiserson.
- Worst-case_complexity wikiPageWikiLink Clifford_Stein.
- Worst-case_complexity wikiPageWikiLink Computer_science.
- Worst-case_complexity wikiPageWikiLink Insertion_sort.
- Worst-case_complexity wikiPageWikiLink Introduction_to_Algorithms.
- Worst-case_complexity wikiPageWikiLink Model_of_computation.
- Worst-case_complexity wikiPageWikiLink Random-access_machine.
- Worst-case_complexity wikiPageWikiLink Ron_Rivest.
- Worst-case_complexity wikiPageWikiLink Thomas_H._Cormen.
- Worst-case_complexity wikiPageWikiLinkText "Worst-case complexity".
- Worst-case_complexity wikiPageWikiLinkText "in the worst-case".
- Worst-case_complexity wikiPageWikiLinkText "worst case cost".
- Worst-case_complexity wikiPageWikiLinkText "worst case".
- Worst-case_complexity wikiPageWikiLinkText "worst-case asymptotically optimal".
- Worst-case_complexity wikiPageWikiLinkText "worst-case complexity".
- Worst-case_complexity wikiPageWikiLinkText "worst-case hardness".
- Worst-case_complexity wikiPageWikiLinkText "worst-case model".
- Worst-case_complexity wikiPageWikiLinkText "worst-case time complexity".
- Worst-case_complexity wikiPageWikiLinkText "worst-case".
- Worst-case_complexity subject Category:Analysis_of_algorithms.
- Worst-case_complexity comment "In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an algorithm requires in the worst-case. It gives an upper bound on the resources required by the algorithm.In the case of running time, the worst-case time-complexity indicates the longest running time performed by an algorithm given any input of size n, and thus this guarantees that the algorithm finishes on time.".
- Worst-case_complexity label "Worst-case complexity".
- Worst-case_complexity sameAs Q8037118.
- Worst-case_complexity sameAs ওয়ার্স্ট_কেইস_পারফরম্যান্স.
- Worst-case_complexity sameAs Complexité_dans_le_pire_des_cas.
- Worst-case_complexity sameAs Complexidade_de_pior_caso.
- Worst-case_complexity sameAs m.04zzfdh.
- Worst-case_complexity sameAs Комплексност_у_најгорем_случају.
- Worst-case_complexity sameAs Q8037118.
- Worst-case_complexity wasDerivedFrom Worst-case_complexity?oldid=534654881.
- Worst-case_complexity isPrimaryTopicOf Worst-case_complexity.