J.F.B uss, J. Goldsmith. "Nondeterminism within P ". SIAM J. Com puting, Vol.22, 560--572, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
New Upper Bounds on the Decomposability of Planar Graphs and.. - Fomin, Thilikos (2003) (1 citation) (Correct)
....to report that no such a set exists. 22 A linear problem kernel of size 2k (with constants c 1 = 1 and c 2 = 2) for the Vertex Cover problem (not necessary planar) was obtained by Chen et al. 12] This result is based on the theoretical results of Nemhauser Trotter [24] and Buss Goldsmith [10]. The running time of the algorithm constructing a kernel of a graph on n vertices is O(kn k ) So in this case T kernel ( I , k) O(kn k ) It is well known that the Vertex Cover problem on graphs on n vertices and with bounded treewidth # can be solved in O(2 n) time. The dynamic ....
J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput., 22 (1993), pp. 560-- 572.
On Efficient Fixed-Parameter Algorithms for Weighted Vertex Cover - Niedermeier (Correct)
....we can reduce the original instance to a smaller one, G # , k # ) where G # is a subgraph of G and k # k. It holds that G has a vertex cover of weight k i# G # has a vertex cover of weight k # . Assuming positive vertex weights 1, a simple standard reduction to problem kernel by Buss (cf. [9]) works based on the following [13] Each vertex with degree greater than k has to be in the vertex cover set, since, otherwise, not all edges can be covered. From this it is easy to obtain that G can be replaced with G # such that G # consists of at most k edges and at most k k vertices ....
J. F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22(3):560--572, 1993.
A High-Performance Toolkit for Fast Exact Algorithms - Abu-Khzam, Langston, Shanbhag (Correct)
....Our vertex cover algorithms exploit reduction and decomposition. During reduction, we condense an arbitrarily difficult instance into its combinatorial core. It has long been known that, if a cover is present, removing vertices whose degree exceeds k reduces G to a graph of size at most k [2]. More complex techniques rely on linear programming relaxation [8, 13] We have fine tuned and implemented these and a number of more recent ideas [1] culminating in a suite of polynomial time routines that yield cores of size 2k or less. When reduction is complete, the core is ready for ....
J.F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560--572, 1993.
Parameterized Computational Feasibility - Downey, Fellows (1994) (37 citations) (Correct)
....and removing a vertex having outdegree indegree. Thus, this problem can be solved with a polylogarithmic amount of nondeterminism, and therefore is unlikely to be complete for NP . For a other studies of polynomial time computational power augmented by limited amounts of nondeterminism see [BG], Re] and [CC] Tournament Dominating Set Instance: A tournament T and a positive integer parameter k. Question: Does T have a dominating set of cardinality at most k Theorem 4.1 Tournament Dominating Set is complete for W [2] Proof. As a special case of Dominating Set it is easily seen to ....
J. F. Buss and J. Goldsmith, "Nondeterminism Within P ," SIAM J. Comp., Vol 22, (1993) 560-572.
New Upper Bounds on the Decomposability of Planar Graphs and.. - Fomin, Thilikos (2002) (1 citation) (Correct)
....k or to report that no such a set exists. A linear problem kernel of size 2k (with constants c 1 = 1 and c 2 = 2) for the Vertex Cover problem (not necessary planar) was obtained by Chen et al. 13] This result is based on the theoretical results of Nemhauser Trotter [24] and Buss Goldsmith [11]. The running time of the algorithm constructing a kernel of a graph on n vertices is O(kn k ) So in this case T kernel (jIj; k) O(kn k ) It is well known that the Vertex Cover problem on graphs on n vertices and with bounded tree width can be solved in O(2 n) time. The ....
J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput., 22 (1993), pp. 560--572.
Molecular Computing, Bounded Nondeterminism, and Efficient.. - Beigel, Fu (1996) (Correct)
....QBF 2 Theta Theta [23] 3 SAT 1:62 Theta [19] 1:50 3 Colorability 1:89 [3] 1:35 Independent Set 1:51 [3] 1:23 (3; 2) system 1:39 n p 3. Bounded Nondeterminism NP computation with a limited amount of nondeterminism was introduced in [14, 15, 16] and studied further in [10, 11, 20, 9, 12, 25, 13, 7]. The class NPbits(b(n) consists of languages recognized by an NP machine that make at most b(n) binary nondeterministic choices on each computation path on inputs of size n. Actually, prior treatments allowed O (b(n) binary choices, but the constant factor turns out to be very important in ....
J. F. Buss and J. Goldsmith. Nondeterminism within P. SICOMP, 22:560--572, 1993.
Molecular Computing, Bounded Nondeterminism, and Efficient.. - Beigel, Fu (1998) (Correct)
....test tube. 2.2.7. Detect This is to test if there is at least one DNA sequence in the solution of a test tube. It is usually done by amplification (see [30] 3. Bounded Nondeterminism NP computation with a limited amount of nondeterminism was introduced in [16, 17, 18] and studied further in [11, 12, 24, 10, 13, 31, 14, 7]. The class NPbits(b(n) consists of all languages recognized by an NP machine that make at most b(n) binary nondeterministic choices on each computation path on inputs of size n. Actually, prior treatments allowed O(b(n) binary choices, but the constant factor turns out to be very important in ....
J. F. Buss and J. Goldsmith. Nondeterminism within P. SICOMP, 22:560--572, 1993.
A Comparison of Resource-Bounded Molecular Computation Models - Fu, Beigel (1998) (6 citations) (Correct)
....1 ; T 2 ; T 0 ) 0; 1 Amplify(T 0 ; T 1 ; T 2 ) 0; 1 0; 1 Append(T 1 ; 0) 00; 10 0; 1 Append(T 2 ; 1) 00; 10 01; 11 Merge(T 1 ; T 2 ; T 0 ) 00; 10; 01; 11 3. Bounded Nondeterminism NP computation with a limited amount of nondeterminism was introduced in [12, 13, 14] and studied further in [8, 9, 17, 7, 10, 20, 11, 5]. The class NPbits(b(n) consists of languages recognized by NP machines that make at most b(n) binary nondeterministic choices on each computation path on inputs of length n. Actually, prior treatments allowed O(b(n) binary choices, but the constant factor is very important in connection with ....
J. F. Buss and J. Goldsmith. Nondeterminism within P. SICOMP, 22:560--572, 1993.
On Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1994) (6 citations) (Correct)
....of Stearns and Hunt that the power index of SAT is 1. Section 5 shows how our notion of counting the number of query bits used by oracle machines relates to previous work on counting queries [Bei87b, AG88, BGH89, ABG90, Bei91, BGGO93, HN93, BKS94] on limited nondeterminism [KF80, DT90, BG93, BG94] and on helping [Sch85, Ko87, Bal90] We show that the known equivalence between search reduces to decision and one sided helping in polynomial time carries over to any reasonable time bound t(n) This yields other forms of our main results in Section 4. Then we observe that an ....
....expresses that each output wire has the correct value given its input wires. Finally, given x of length n, instantiate the variables x 1 ; x 1 ; x n ; x n accordingly and simplify the resulting formula (if so desired) This reduces L to SAT in time O(q(n) log q(n) Buss and Goldsmith [BG93] note some other properties of this construction. Robson [Rob91] gives another efficient reduction that starts with a nondeterministic RAM rather than an NTM. Linear and quasilinear time reductions from SAT to many other problems in NQL may be found in [Dew81, Dew82, Dew89, SH86, SH90] Regan ....
[Article contains additional citation context not shown here]
J. Buss and J. Goldsmith. Nondeterminism within P. SIAM J. Comput., 22:560-- 572, 1993.
Improvement on Vertex Cover for Low-Degree Graphs - Chen, al. (2000) (Correct)
....of the parameter k but independent of the input length n and c is a constant independent of the parameter k. Continuous e#orts have been made in improving fixed parameter tractable algorithms for the vertex cover problem, starting from Buss algorithm of running time O(kn 2 k k 2k 2 ) [2]. Downey and Fellows [4] developed an O(kn 2 k k 2 ) time algorithm. More recently, Balasubramanian et al. 1] developed an O(kn 1.3247 k k 2 ) time algorithm. Later Downey et al. 6] improved the result slightly to time complexity O(kn 1.3195 k k 2 ) and Niedermeier and Rossmanith ....
J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J Comput 22 (1993), 560--572.
Fixed-Parameter Complexity and Cryptography - Fellows, Koblitz (1993) (4 citations) (Correct)
.... k such that for every pair of vertices u; v 2 V 0 we have uv 2 E But we have the following contrasting results concerning the computational complexity of the parameterized versions of these problems: 1) for each fixed value of the parameter k, Vertex Cover is solvable in linear time [2], 2) for each fixed value of the parameter k, the best known algorithm for Clique runs in time O(n 2k=3 ) 18] In this paper, by a parameterized problem we mean a computational problem whose input includes a positive integer parameter that we will invariably denote by k. A parameterized ....
....the property that for each vertex v 2 V there is precisely one vertex in N [v] V 0 . Perfect Code Input: A graph G = V; E) and a positive integer parameter k. Question: Does G have a k element perfect code In [8] it is shown that the Perfect Code problem belongs to the complexity class W [2] and is hard for the class W [1] Without going into the details of the theory (which can be found in [5 8] this tells us concretely that demonstrating fixed parameter tractability for Perfect Code would be at least as difficult as demonstrating fixed parameter tractability for the well known ....
[Article contains additional citation context not shown here]
J. Buss and J. Goldsmith, Nondeterminism within P , SIAM J. Computing, to appear.
The inapproximability of non NP-hard optimization problems - Cai, Juedes, Kanj (1999) (Correct)
....(V C) Dimension, and many restricted versions of NP complete problems have the property that they can be solved with a limited (i.e. O(log k n) amount of nondeterminism, yet are not known to have ecient deterministic solutions. Such problems have been investigated extensively in the literature [6, 8, 9, 10, 14, 16, 22, 23, 26]. See [18] for a survey of results. Since these problems can be solved deterministically in O(n log k n ) time, it is unlikely that these problems are NP hard since this would imply that every problem in NP is computable in quasi polynomial time. In this paper, we are particularly ....
J. F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560-572, 1993.
Sharply Bounded Alternation within P - Bloch (1995) (2 citations) Self-citation (Buss Goldsmith) (Correct)
No context found.
J.F. Buss and J. Goldsmith, "Nondeterminism within P," SIAM J. Comput. 22 (1993) 560--572.
A Parallel FPT - Appli Ko For (Correct)
No context found.
J.F.B uss, J. Goldsmith. "Nondeterminism within P ". SIAM J. Com puting, Vol.22, 560--572, 1993.
The Emptiness Problem for - Intersections Of Regular (Correct)
No context found.
J. F. Buss and J. Goldsmith. Nondeterminism within P . In Proc. of 8th STACS, number 480 in LNCS, pages 348--359. Springer, 1991.
A Parallel FPT - Appli Ko For (Correct)
No context found.
J.F.B uss, J. Goldsmith. "Nondeterminism within P ". SIAM J. Com puting, Vol.22, 560--572, 1993.
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (Correct)
No context found.
J.F.B uss, J. Goldsmith. "Nondeterminism within P ". SIAM J. Com puting, Vol.22, 560--572, 1993.
A Two-Pronged Attack on the Dragon of Intractability - Gilmour, Dras (2005) (Correct)
No context found.
Buss, J. F. & Goldsmith, J. (1993), `Nondeterminism within P', SIAM J. Comput. 22(3), 560--572.
Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (145 citations) (Correct)
No context found.
J. F. Buss and J. Goldsmith, "Nondeterminism Within P ," SIAM J of Comput. 22 (1993) 560-572.
Fixed-Parameter Tractability and Completeness I: Basic Results - Downey, Fellows (1995) (145 citations) (Correct)
No context found.
S. Buss and J. Goldsmith,"Nondeterminism within P ", SIAM Journal of Computing, Vol 22, (1993) 560-572.
Scalable Parallel Algorithms for Difficult.. - Abu-Khzam, Langston.. (Correct)
No context found.
J.F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560--572, 1993.
Computational, Integrative and Comparative Methods .. - Baldwin, Chesler, .. (Correct)
No context found.
J. F. Buss and J. Goldsmith. Nondeterminism within P . SIAM Journal on Computing, 22:560--572, 1993.
A Parallel FPT Application for Clusters - Cheetham, Dehne, al. (2003) (Correct)
No context found.
J.F.B uss, J. Goldsmith. "Nondeterminism within P ". SIAM J. Com puting, Vol.22, 560--572, 1993.
Kernelization Algorithms for the Vertex Cover.. - Abu-Khzam.. (Correct)
No context found.
J.F. Buss and J. Goldsmith. Nondeterminism within P. SIAM Journal on Computing, 22:560--572, 1993.
New Upper Bounds on the Decomposability of Planar Graphs and.. - Fomin, Thilikos (2002) (1 citation) (Correct)
No context found.
J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput., 22 (1993), pp. 560--572.
First 50 documents Next 50
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