arXiv Open Access 2025

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

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (2)

Rares Folea

Emil-Ioan Slusanschi

Format Sitasi

APA MLA BibTeX

Folea, R., Slusanschi, E. (2025). 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. https://arxiv.org/abs/2511.00589

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓