Multi-Metric Algorithmic Complexity: Beyond Asymptotic Analysis
Sergii Kavun

TL;DR
This paper introduces a weighted-operation complexity model that evaluates algorithms across multiple dimensions like time, energy, and cost, providing a practical tool for architecture-aware analysis beyond traditional asymptotic methods.
Contribution
It presents a novel multi-metric complexity model that assigns realistic costs to operations, enabling comprehensive, multi-objective algorithm evaluation in real-world scenarios.
Findings
High correlation ( >0.9) with measured data across architectures
Outperforms traditional baselines like Big-O, ICE, and EVM gas
Provides practical efficiency recommendations for various algorithms
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
