{"ID":2881118,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.13249","arxiv_id":"2508.13249","title":"Multi-Metric Algorithmic Complexity: Beyond Asymptotic Analysis","abstract":"Traditional algorithm analysis treats all basic operations as equally costly, which hides significant differences in time, energy consumption, and cost between different types of computations on modern processors. We propose a weighted-operation complexity model that assigns realistic cost values to different instruction types across multiple dimensions: computational effort, energy usage, carbon footprint, and monetary cost. The model computes overall efficiency scores based on user-defined priorities and can be applied through automated code analysis or integrated with performance measurement tools. This approach complements existing theoretical models by enabling practical, architecture-aware algorithm comparisons that account for performance, sustainability, and economic factors. We demonstrate an open-source implementation that analyzes code, estimates multi-dimensional costs, and provides efficiency recommendations across various algorithms. We address two research questions: (RQ1) Can a multi-metric model predict time/energy with high accuracy across architectures? (RQ2) How does it compare to baselines like Big-O, ICE, and EVM gas? Validation shows strong correlations (\\r{ho}\u003e0.9) with measured data, outperforming baselines in multi-objective scenarios.","short_abstract":"Traditional algorithm analysis treats all basic operations as equally costly, which hides significant differences in time, energy consumption, and cost between different types of computations on modern processors. We propose a weighted-operation complexity model that assigns realistic cost values to different instructi...","url_abs":"https://arxiv.org/abs/2508.13249","url_pdf":"https://arxiv.org/pdf/2508.13249v1","authors":"[\"Sergii Kavun\"]","published":"2025-08-18T13:12:36Z","proceeding":"cs.PF","tasks":"[\"cs.PF\",\"cs.AR\",\"cs.CC\",\"cs.DS\"]","methods":"[]","has_code":false}