Personal website Rudolf Adamkovič

Home / Computer science


Asymptotic complexity

A kind of computational complexity that

emphasizes the order of growth

as the input size tends to infinity by

ignoring constant factors and lower-order terms.


© 2025 Rudolf Adamkovič under GNU General Public License version 3.
Made with Emacs and secret alien technologies of yesteryear.