Complexity problems in computational theory

This book presents methods and techniques for constructing “fast” algorithms for solving problems on graphs and geometrical problems in complexity bounds in general computability theory.