In general, not even humans can, or can only proof upper bounds which aren't tight (or not known whether the bounds are tight).
In reply to Re: Algorithm complexity
by JavaFan
in thread Algorithm complexity
by fauria
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |