[1979]: Some remarks on a classification of oracle-type algorithms. In: Numerische Methoden bei graphentheoretischen and kombinatorischen Problemen; Band 2 ( L. Collatz, G. Meinardus, W. Wetterling, eds.), Birk
Hence, the first main theorem gives an upper bound on the counting function in terms of the characteristic function. The lower bound for the sum of certain counting functions is called the second main theorem. Such types of estimates were given in several situations. A holomorphic curve f:C→...
1. The advantages of the algorithms of Theorem 3, Theorem 4, Theorem 5 appear simultaneously in the three-layer Manhattan model. Theorem 6 Gallai’s greedy interval packing algorithm solves any channel routing problem in the three-layer Manhattan model in linear, that is, in O(l) time with...