bounds for problem complexity, and there are few methods for obtaining such lower bounds.

For solving most problems, it is necessary to read all input data, which, normally, needs a time proportional to the size of the data. Thus, such problems have a complexity that is at least linear, that is, using big omega notation, a complexity

The solution of some problems, typically in computer algebra and computational algebraic geometry,

1.Previous
3.Next