Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q333464> ?p ?o }
Showing triples 1 to 77 of
77
with 100 triples per page.
- Q333464 subject Q7451559.
- Q333464 subject Q8250013.
- Q333464 abstract "In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem. These estimates provide an insight into reasonable directions of search for efficient algorithms.In theoretical analysis of algorithms it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Big O notation, Big-omega notation and Big-theta notation are used to this end. For instance, binary search is said to run in a number of steps proportional to the logarithm of the length of the list being searched, or in O(log(n)), colloquially "in logarithmic time". Usually asymptotic estimates are used because different implementations of the same algorithm may differ in efficiency. However the efficiencies of any two "reasonable" implementations of a given algorithm are related by a constant multiplicative factor called a hidden constant.Exact (not asymptotic) measures of efficiency can sometimes be computed but they usually require certain assumptions concerning the particular implementation of the algorithm, called model of computation. A model of computation may be defined in terms of an abstract computer, e.g., Turing machine, and/or by postulating that certain operations are executed in unit time.For example, if the sorted list to which we apply binary search has n elements, and we can guarantee that each lookup of an element in the list can be done in unit time, then at most log2 n + 1 time units are needed to return an answer.".
- Q333464 wikiPageWikiLink Q11028.
- Q333464 wikiPageWikiLink Q11197.
- Q333464 wikiPageWikiLink Q11216.
- Q333464 wikiPageWikiLink Q11348.
- Q333464 wikiPageWikiLink Q1138496.
- Q333464 wikiPageWikiLink Q1141518.
- Q333464 wikiPageWikiLink Q1155722.
- Q333464 wikiPageWikiLink Q1155831.
- Q333464 wikiPageWikiLink Q1156793.
- Q333464 wikiPageWikiLink Q117241.
- Q333464 wikiPageWikiLink Q1207152.
- Q333464 wikiPageWikiLink Q12525525.
- Q333464 wikiPageWikiLink Q1296251.
- Q333464 wikiPageWikiLink Q13414364.
- Q333464 wikiPageWikiLink Q1398821.
- Q333464 wikiPageWikiLink Q14953108.
- Q333464 wikiPageWikiLink Q163310.
- Q333464 wikiPageWikiLink Q170008.
- Q333464 wikiPageWikiLink Q17092099.
- Q333464 wikiPageWikiLink Q174666.
- Q333464 wikiPageWikiLink Q1753188.
- Q333464 wikiPageWikiLink Q186094.
- Q333464 wikiPageWikiLink Q188804.
- Q333464 wikiPageWikiLink Q189057.
- Q333464 wikiPageWikiLink Q189224.
- Q333464 wikiPageWikiLink Q2028293.
- Q333464 wikiPageWikiLink Q205084.
- Q333464 wikiPageWikiLink Q2091879.
- Q333464 wikiPageWikiLink Q21198.
- Q333464 wikiPageWikiLink Q215206.
- Q333464 wikiPageWikiLink Q2393193.
- Q333464 wikiPageWikiLink Q243754.
- Q333464 wikiPageWikiLink Q245962.
- Q333464 wikiPageWikiLink Q2651576.
- Q333464 wikiPageWikiLink Q269878.
- Q333464 wikiPageWikiLink Q272683.
- Q333464 wikiPageWikiLink Q27948.
- Q333464 wikiPageWikiLink Q331716.
- Q333464 wikiPageWikiLink Q3435924.
- Q333464 wikiPageWikiLink Q3454686.
- Q333464 wikiPageWikiLink Q40056.
- Q333464 wikiPageWikiLink Q486598.
- Q333464 wikiPageWikiLink Q527381.
- Q333464 wikiPageWikiLink Q582659.
- Q333464 wikiPageWikiLink Q622381.
- Q333464 wikiPageWikiLink Q651022.
- Q333464 wikiPageWikiLink Q68.
- Q333464 wikiPageWikiLink Q7268362.
- Q333464 wikiPageWikiLink Q727490.
- Q333464 wikiPageWikiLink Q7451559.
- Q333464 wikiPageWikiLink Q752718.
- Q333464 wikiPageWikiLink Q7546449.
- Q333464 wikiPageWikiLink Q7702793.
- Q333464 wikiPageWikiLink Q771906.
- Q333464 wikiPageWikiLink Q787114.
- Q333464 wikiPageWikiLink Q787903.
- Q333464 wikiPageWikiLink Q796829.
- Q333464 wikiPageWikiLink Q79726.
- Q333464 wikiPageWikiLink Q816747.
- Q333464 wikiPageWikiLink Q82438.
- Q333464 wikiPageWikiLink Q8250013.
- Q333464 wikiPageWikiLink Q82753.
- Q333464 wikiPageWikiLink Q83021.
- Q333464 wikiPageWikiLink Q8366.
- Q333464 wikiPageWikiLink Q838801.
- Q333464 wikiPageWikiLink Q868299.
- Q333464 wikiPageWikiLink Q8789.
- Q333464 wikiPageWikiLink Q912887.
- Q333464 wikiPageWikiLink Q9135.
- Q333464 wikiPageWikiLink Q9143.
- Q333464 wikiPageWikiLink Q922367.
- Q333464 wikiPageWikiLink Q942403.
- Q333464 comment "In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length.".
- Q333464 label "Analysis of algorithms".