Complexity problems in computational theory
Complexity problems in computational theory
A. Slisenko
1981 · DOI: 10.1070/RM1981V036N06ABEH003102
11 Citations
TLDR
This book presents methods and techniques for constructing "fast" algorithms for solving problems on graphs and geometrical problems and describes the development of lower complexity bounds for restricted models.
