Results 1  10
of
3,664,023
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
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
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
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
Crozzle: an NPComplete Problem
 In SAC ’97: Proceedings of the 1997 ACM symposium on Applied computing
, 1997
"... At the 1996 Symposium on Applied Computing, it was argued that the RbyC Crozzle problem was NPHard, but not in NP. The original Crozzle problem is a word puzzle that appears, with a cash reward for the highest score, in The Australian Women's Weekly. The RbyC Crozzle problem generalizes the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the original. We argue that both problems are in fact NPComplete. This follows from the reduction of exact 3set cover to RbyC Crozzle and the demonstration of a nondeterministic polynomial time algorithm for solving an arbitrary instance of the RbyC Crozzle problem. A Java implementation
The median problems for breakpoints are NPcomplete
 Elec. Colloq. on Comput. Complexity
, 1998
"... The breakpoint distance between two npermutations is the number of pairs that appear consecutively in one but not in the other. In the median problem for breakpoints one is given a set of permutations and has to construct a permutation that minimizes the sum of breakpoint distances to all the origi ..."
Abstract

Cited by 71 (1 self)
 Add to MetaCart
the original ones. Recently, the problem was suggested as a model for determining the evolutionary history of several species based on their gene orders. We show that the problem is already NPhard for three permutations, and that this result holds both for signed and for unsigned permutations.
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
Lambek calculus is npcomplete
 Theoretical Computer Science
, 2003
"... We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L ∗ the derivability problem is NPcomplete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NPcomplete. ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
We prove that for both the Lambek calculus L and the Lambek calculus allowing empty premises L ∗ the derivability problem is NPcomplete. It follows that also for the multiplicative fragments of cyclic linear logic and noncommutative linear logic the derivability problem is NPcomplete.
NPcomplete problems and physical reality
 ACM SIGACT News Complexity Theory Column, March. ECCC
, 2005
"... Can NPcomplete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantummechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Mal ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
Can NPcomplete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantummechanical nonlinearities, hidden variables, relativistic time dilation, analog computing
Results 1  10
of
3,664,023