Abstract:
The article is a survey report text on methods of obtaining computational complexity lower bounds. Besides that trade-off methods connected with them are,exposed. Schemes, crossing sequencies, tails, overlaps and related methods are considered. For illustrations of the methods somewhere in the article a new proof of an old result is given or a new result is proved.
