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
By: Rares Folea, Emil-Ioan Slusanschi
Potential Business Impact:
Helps computers understand programs better.
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.
Similar Papers
Multi-Metric Algorithmic Complexity: Beyond Asymptotic Analysis
Performance
Makes computer code faster, cheaper, and greener.
Unveiling Hybrid Cyclomatic Complexity: A Comprehensive Analysis and Evaluation as an Integral Feature in Automatic Defect Prediction Models
Software Engineering
Finds bugs in computer programs faster.
Compression, Regularity, Randomness and Emergent Structure: Rethinking Physical Complexity in the Data-Driven Era
Machine Learning (CS)
Organizes ways to measure how complex things are.