Results 1  10
of
510,258
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 STOproblem is NPcomplete
"... this paper, but will help the reader to understand our construction. ..."
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 98 (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 NPhard
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 229 (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
Contextual Reasoning is NPcomplete
 In National Conference on Artificial Intelligence (AAAI 96
, 1996
"... The logic of context with the ist (c; p) modality has been proposed by McCarthy as a foundation for contextual reasoning. This paper shows that propositional logic of context is NPcomplete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACEcom ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
The logic of context with the ist (c; p) modality has been proposed by McCarthy as a foundation for contextual reasoning. This paper shows that propositional logic of context is NPcomplete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACEcomplete
How to Cope with NPCompleteness
, 2013
"... NPcomplete problems arise frequently in practice. In today’s lecture, we discuss various approaches for coping with NPcomplete problems. When NPcompleteness was discovered, algorithm designers could take it as an excuse. It is true, that I have not found an efficient algorithm. However, nobody wi ..."
Abstract
 Add to MetaCart
will ever find an efficient algorithm (unless P = NP). Nowadays, NPcompleteness is considered a challenge. One searchers for exact algorithms with running time c n with small c, one searches for approximation algorithms with a good approximation ratio, one tries to prove that the problem is hard
Some NPcomplete Geometric Problems
 In 8th ACM Symposium on Theory of Computing, STOC
, 1976
"... 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 if ..."
Abstract

Cited by 1 (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 NPhard
An NPcomplete fragment of LTL
"... Abstract. A fragment of linear time temporal logic (LTL) is presented. It is proved that the satis¯ability problem for this fragment is NPcomplete. The fragment is larger than previously known NPcomplete fragments. It is obtained by prohibiting the use of until operator and requiring to use only n ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. A fragment of linear time temporal logic (LTL) is presented. It is proved that the satis¯ability problem for this fragment is NPcomplete. The fragment is larger than previously known NPcomplete fragments. It is obtained by prohibiting the use of until operator and requiring to use only
Hamiltonian index is NPcomplete
, 2009
"... In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is
Results 1  10
of
510,258