Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Properties of calculus in r-Complexity 2025
Rares Folea, Emil Slusanschi
This paper presents a series of general properties of the r-Complexity calculus, a complexity measurement for assessing the performance and asymptotic behaviour of real-world algor…
cs.CC2025
A new metric for evaluating the performance and complexity of computer programs: A new approach to the traditional ways of measuring the complexity of algorithms and estimating running times
Rares Folea, Emil-Ioan Slusanschi
This paper presents a refined complexity calculus model: r-Complexity, a new asymptotic notation that offers better complexity feedback for similar programs than the traditional Ba…