Results 21 to 30 of about 272,983 (311)
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
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
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
AN NP-COMPLETE FRAGMENT OF LTL [PDF]
International Journal of Foundations of Computer Science, 2004 A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NP-complete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter.
Muscholl, Anca, Walukiewicz, Igor
openaire +2 more sources
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Total dominating set, connected vertex cover and Steiner tree are well-known graph problems. Despite the fact that they are NP-complete to optimize, it is easy (even trivial) to find solutions, regardless of their size.
Alexis Cornet, Christian Laforest
doaj +1 more source
Nonuniform Reductions and NP-Completeness
Theory of Computing Systems, 2022 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.
John M. Hitchcock, Hadi Shafei
openaire +5 more sources
NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
Моделирование и анализ информационных систем, 2019 In this paper, we study the two-step colouring problem for an undirected connected graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or ...
Natalya Sergeevna Medvedeva +1 more
doaj +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
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
Discussiones Mathematicae Graph Theory, 2020 In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
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 +3 more sources