I wounder why the complexity of algorithms always depend on the size of the input, but not on the size of the output.
For example, in a problem that I have solve, the size of the input is exponentially smaller than the size of output. In addition, the complexity of the algorithm is polynomial by the size of the output, and pseudo-polynomial by the size of the input.
I think that in such case, the complexity of algorithm is said to be "polynomial", but I am not sure about it.
What are your opinion?