S. Buss, private communication, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parameterized Computational Feasibility - Downey, Fellows (1994) (37 citations) (Correct)
....function of the parameter k. The instance I is then exhaustively analyzed, and a solution for I can be lifted to a solution for I, in the case where a solution exists. We illustrate the method with the problems Vertex Cover and Max Leaf Spanning Tree [GJ] defined below) Theorem 2. 7 (Buss [Bu]) Vertex Cover can be solved in time O(n k ) Proof. Observe that for a simple graph H any vertex of degree greater than k must belong to every k element vertex cover of H. Step 1: Locate all vertices in H of degree greater than k; let p equal the number of such vertices. If p k, there is ....
S. Buss, private communication, 1989.
Predicative Recursion and Computational Complexity - Bellantoni (1992) (24 citations) (Correct)
....another definition of feasible higher type computation, namely 8f: 8x:W (x) W (f(x) W (F (f) in a suitable second order system. In an earlier draft of this work we used the functions D(a; b) j P (b; a) and E(a; b) j P (b; P (b; a) as initial functions; Sam Buss pointed out to us [B2] that these two can be eliminated in favor of the single predecessor function, p. See the comments near the end of Part II for a discussion of how D and E are still of interest. 24 Chapter 3 Polytime As a motivating example, consider the definition of the fi function (similar to the smash ....
S. Buss, private communication, Hotel Mazanka, Prague, July 1991. -- 159 --
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) (Correct)
No context found.
S. Buss, private communication, 1989.
Parameterized Parallel Complexity - Cesati, Di Ianni (1997) (4 citations) (Correct)
No context found.
S. Buss. Private communication. 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC