A General Definition of the O-notation for Algorithm Analysis.
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE（2015）
Abstract
We provide an extensive list of desirable properties for an O-notationas used in algorithm analysis - and reduce them to 8 primitive properties. We prove that the primitive properties are equivalent to the definition of the O-notation as linear dominance.
MoreTranslated text
Key words
algorithm analysis,definition,o-notation
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined