Results 1  10
of
1,739,558
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
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
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
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
The STOproblem is NPcomplete
"... this paper, but will help the reader to understand our construction. ..."
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
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.
Training a 3Node Neural Network is NPComplete
, 1992
"... We consider a 2layer, 3node, ninput neural network whose nodes compute linear threshold functions of their inputs. We show that it is NPcomplete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We ..."
Abstract

Cited by 227 (3 self)
 Add to MetaCart
We consider a 2layer, 3node, ninput neural network whose nodes compute linear threshold functions of their inputs. We show that it is NPcomplete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We
Results 1  10
of
1,739,558