Results 31 to 40 of about 369,293 (294)
The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search
Undergraduate Journal of Mathematical Modeling: One + Two, 2012 The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are ...
Bo Moon
doaj +1 more source
BRICS Report Series, 2007 In a Hiroimono puzzle, one must collect a set of stones from a square grid, moving along grid lines, picking up stones as one encounters them, and changing direction only when one picks up a stone. We show that deciding the solvability of such puzzles is NP-complete.
openaire +4 more sources
Information Processing Letters, 2006 Tetravex is a widely played one person computer game in which you are given $n^2$ unit tiles, each edge of which is labelled with a number. The objective is to place each tile within a $n$ by $n$ square such that all neighbouring edges are labelled with an identical number. Unfortunately, playing Tetravex is computationally hard.
Yasuhiko Takenaga, Toby Walsh
openaire +4 more sources
Version Spaces, Structural Descriptions and NP-Completeness
, 2018 Kevin T. Kelly.
Kevin T. Kelly (362540)
core +1 more source
Computational Complexity in Additive Hedonic Games [PDF]
, 2008 We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive.
Shao-Chin Sung +3 more
core +1 more source
NP-completeness of Bipartite Exact Cut
, 2019 \textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$, one needs to determine whether there exists a cut of size at least $k$ in $G$. An exact version is likewise asking whether $G$ has a cut of size exactly $
Thinh D. Nguyen (6385907)
core +1 more source
NP-completeness notions under strong hypotheses [PDF]
, 2000 A variety of completeness notions for the complexity class NP are studied under strong hypotheses about the size of this class. These hypotheses are based on the concept of resource-bounded genericity developed by Ambos-Spies, Fleischhack and Huwig.
Bentzien, Levke
core +1 more source
NP-Completeness in the gossip monoid [PDF]
International Journal of Algebra and Computation, 2018 Gossip monoids form an algebraic model of networks with exclusive, transient connections in which nodes, when they form a connection, exchange all known information. They also arise naturally in pure mathematics, as the monoids generated by the set of all equivalence relations on a given finite set under relational composition.
Peter Fenner +2 more
openaire +6 more sources
Nonuniform Reductions and NP-Completeness [PDF]
, 2018 Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger complexity classes.
Hitchcock, John M., Shafei, Hadi
core +1 more source
Two railway circuits: a universal circuit and an NP-difficult one [PDF]
Computer Science Journal of Moldova, 2001 In this paper, first we construct a railway circuit based on three types of switches and on crossings. Such a circuit is able to simulate the computation of any Turing machine, in particular of a universal one. That result was proved by Ian Stewart in [3]
Maurice Margenstern
doaj