Suggestions to understand complexities

40 Views Asked by At

I am currently working on pure math based cryptography,and I haven't ever studied Complexities. I need to understand how complexities of any algorithm works from a mathematical point of view. For example, the left canonical form of a word with word length l (on generators of the braid group) can be computed in time O(l^2*logn). To understand this proof,I will need some basic understanding of complexities in general,so any suggestions are welcome!