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
Preprint
Abstract
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 Bachmann-Landau notation, providing subtle insights even for algorithms that are part of the same conventional complexity class. The architecture-dependent metric represents an enhancement that provides better sensitivity with respect to discrete analysis.Keywords
All Related Versions
- Version 1, 2025-11-01, ArXiv
- Published version: , 157.
This publication has 4 references indexed in Scilit:
- Losing Chess: 1. e3 Wins for WhiteICGA Journal: The Journal of the Computer Games Community, 2017
- A New Asymptotic Notation: Weak ThetaMathematical Problems in Engineering, 2015
- Zermelo and the Early History of Game TheoryGames and Economic Behavior, 2001
- XXII. Programming a computer for playing chessJournal of Computers in Education, 1950