1.Previous
3.Next

may be very large. In such a case, the complexity is bounded from below by the maximal size of the output, since the output must be written. For example, a system of {{mvar may have up to complex solutions, if the number of solutions is finite (this is Bézout's theorem). As these solutions must be written down, the complexity of this problem is For this problem, an algorithm of complexity is known,

1.Previous
3.Next