# Big-O Big theta Big omega papers

I'm studying algorithms complexities by myself (my university didn't it to me) and I'd love if someone could help me in finding good resources to learn fundamental algorithms complexities proofing. There are lots of non-mathematical resources about big-Oh notation but I'd like something more mathematical and rigorous (although understandable) on the topic

-
Last chapter (on asymptotics) in $\mathit{Concrete Mathematics}$ by Graham, Knuth and Patashnik –  Alex Mar 25 '13 at 22:02