Results 1  10
of
3,853,012
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Experiments on Optimally Solving NPcomplete Problems on Planar Graphs
"... Many NPcomplete problems on planar graphs are "fixed parameter tractable." There are new, tree decomposition based fixed parameter algorithms solving, for example, Vertex Cover or Dominating Set optimally in time O(c p k n). Here, c is some constant, n is the number of graph vertices, and ..."
Abstract
 Add to MetaCart
Many NPcomplete problems on planar graphs are "fixed parameter tractable." There are new, tree decomposition based fixed parameter algorithms solving, for example, Vertex Cover or Dominating Set optimally in time O(c p k n). Here, c is some constant, n is the number of graph vertices
Learning Bayesian Networks is NPComplete
, 1996
"... Algorithms for learning Bayesian networks from data havetwo components: a scoring metric and a search procedure. The scoring metric computes a score reflecting the goodnessoffit of the structure to the data. The search procedure tries to identify network structures with high scores. Heckerman e ..."
Abstract

Cited by 225 (8 self)
 Add to MetaCart
relative posterior probability greater than a given constant is NPcomplete, when the BDe metric is used. 12.1
A general approximation technique for constrained forest problems
 SIAM J. COMPUT.
, 1995
"... We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph with trees, cycles, or paths satisfying certain requirements. In particular, many basic combinatorial optimization proble ..."
Abstract

Cited by 418 (21 self)
 Add to MetaCart
is obtained for the 2matching problem and its variants. We also derive the first approximation algorithms for many NPcomplete problems, including the nonfixed pointtopoint connection problem, the exact path partitioning problem, and complex locationdesign problems. Moreover, for the prize
NPComplete
"... Model of Molecular Computation As do abstract models of all types of computation, a model of molecular computation consists of two components, i.e., a mechanism for data representation (using molecules) and a set of operations on data (i.e., molecules and test cubes). The following model of molecul ..."
Abstract
 Add to MetaCart
models all assume that T is a multiset, i.e., a collection of elements that might be repeated. However, we will not use this feature in the present model. The construction of strings and the interpretation of the meaning of the strings depend on the problem solved, and constitute an important part
NPComplete
"... this article, use of the term crossover (or mating) assumes that mutation is included unless otherwise noted. ..."
Abstract
 Add to MetaCart
this article, use of the term crossover (or mating) assumes that mutation is included unless otherwise noted.
Some NPcomplete Geometric Problems
"... We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NPhard i ..."
Abstract

Cited by 99 (1 self)
 Add to MetaCart
We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NPcomplete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP
edgedeletion NPcomplete problems
 Conference Record of the Tenth Annual ACM Symposium on Theory of Computing (San Diego, Calif., 1978), ACM
, 1978
"... If ~ is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property ~. In this paper we show that if ~ belongs to a rather broad class of properties (the class of properties that ..."
Abstract

Cited by 90 (0 self)
 Add to MetaCart
that are hereditary on induced subgraphs) then the nodedeletion problem is NPcomplete, and the same is true for several restrictions of it. For the same class of properties, requi~ing the remaining graph to be connected does not change the NPcomplete status of the problem; moreover for a certain subclass, finding
Using Genetic Algorithms to Solve NPComplete Problems
, 1989
"... A strategy for using Genetic Algorithms (GAs) to solve NPcomplete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NPcomplete problems are equally difficult in a general computational sense, some have much better GA representations than o ..."
Abstract

Cited by 148 (5 self)
 Add to MetaCart
A strategy for using Genetic Algorithms (GAs) to solve NPcomplete problems is presented. The key aspect of the approach taken is to exploit the observation that, although all NPcomplete problems are equally difficult in a general computational sense, some have much better GA representations than
Protocol insecurity with finite number of sessions is NPcomplete
 Theoretical Computer Science
, 2001
"... We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NPcomplete with respect to a DolevYao model of intruders. The result does not assume a limit on the size of messages and supports nonat ..."
Abstract

Cited by 183 (12 self)
 Add to MetaCart
We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NPcomplete with respect to a DolevYao model of intruders. The result does not assume a limit on the size of messages and supports non
Results 1  10
of
3,853,012