Results 1  10
of
329,058
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
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
Neural Networks For NPComplete Problems
, 1996
"... : combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NPcomplete problems that have a sound ..."
Abstract
 Add to MetaCart
: combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NPcomplete problems that have a sound
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
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
New quantum algorithm for studying NPcomplete problems
, 2008
"... Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NPcomplete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm with ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Ordinary approach to quantum algorithm is based on quantum Turing machine or quantum circuits. It is known that this approach is not powerful enough to solve NPcomplete problems. In this paper we study a new approach to quantum algorithm which is a combination of the ordinary quantum algorithm
System Design is an NPComplete Problem
 Systems Engineering
, 2001
"... The system design process translates the customers ’ needs into a buildable system design. It requires selecting subsystems from an allowable set and matching the interfaces between them. Designs that meet the toplevel input and output requirements are tested to see how well they meet the system’s ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
performance and cost goals. This paper proves that the System Design Problem is NPcomplete by reduction from the Knapsack Problem, which is known to be NPcomplete. The implication of this proof is that designing optimal systems with deterministic, polynomial time procedures is not possible
Statistical Mechanics of an NPcomplete Problem: Subset Sum
, 2001
"... We study statistical properties of an NPcomplete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NPcomplete problem and has been studied in the physics literature. The asymptotic ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We study statistical properties of an NPcomplete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NPcomplete problem and has been studied in the physics literature. The asymptotic
Results 1  10
of
329,058