Selected Slither Link Variants are NP-complete
نویسندگان
چکیده
منابع مشابه
Selected Slither Link Variants are NP-complete
In a Slither Link puzzle, the player must draw a cycle in a planar graph, such that the number of edges incident to a set of clue faces equals the set of given clue values. We show that for a number of commonly played graph classes, the Slither Link puzzle is NP-complete.
متن کاملSpiral Galaxies Puzzles are NP-complete
We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...
متن کاملInapproximability of NP-Complete Variants of Nash Equilibrium
In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an ε-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size O(logn) in the random graph G(n,1/2). This raises the question of whether a similar intractability holds for approximate Nash equilibrium without side constraints such as high value. We give ...
متن کاملContact graphs of line segments are NP-complete
Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of line segments in the plane are considered — it is proved that recognizing line-segment contact graphs, with contact degrees of 3 or more, is an NP-complete problem, even for planar graphs. This result contributes to the rel...
متن کاملThe median problems for breakpoints are NP-complete
The breakpoint distance between two n-permutations 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 original ones. Recently, the problem was suggested as a model for determining the evolutionary history...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Information Processing
سال: 2012
ISSN: 1882-6652
DOI: 10.2197/ipsjjip.20.709