scientific article; zbMATH DE number 3909741

MaRDI QIDQ3686040zbMATH OpenFDO

Authors Gilles Brassard

Publication date 1985

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3965440
• A general definition of the O-notation for algorithm analysis
• Why big-O and little-o in algorithm complexity: a pedagogical remark
• A new asymptotic notation: Weak Theta
• Two Notes on Notation

Cited in

(12)

• Collapsing degrees
• Behaviour of exponential splines as tensions increase without bound
• A new asymptotic notation: Weak Theta
• Minimal characterization of O-notation in algorithm analysis
• The exact fitting problem in higher dimensions
• Why big-O and little-o in algorithm complexity: a pedagogical remark
• Notations Around the World: Census and Exploitation
• scientific article; zbMATH DE number 3965440 (Why is no real title available?)
• Homogeneous and non-homogeneous algorithms
• A general definition of the O-notation for algorithm analysis
• Gaps, ambiguity, and establishing complexity-class containments via iterative constant-setting
• Uncloneable quantum advice

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686040)