نتایج جستجو برای: np complete problem

تعداد نتایج: 1212329  

1996
STEPHAN HARTMANN Stephan Hartmann

The design of integrated circuits has achieved a great deal of attention in the last decade. In the routing phase, an open layout problem has survived which is important from both the theoretical and the practical point of view. The channel routing problem has been known to be solvable in polynomial time when there are only 2–terminal nets, and is proved by Sarrafzadeh to be NP–complete in case...

2017
Markus Lohrey Georg Zetzsche

Myasnikov et al. have introduced the knapsack problem for arbitrary finitely generated groups. In [24] the authors proved that for each graph group, the knapsack problem can be solved in NP. Here, we determine the exact complexity of the problem for every graph group. While the problem is TCcomplete for complete graphs, it is LogCFL-complete for each (non-complete) transitive forest. For every ...

2003
Weng-Long Chang Minyi Guo Jesse Wu

Cook's Theorem [9, 10] is that if one algorithm for one NP-complete problem will be developed, then other problems will be solved by means of reduction to that problem. Cook's Theorem has been demonstrated to be right in a general digital electronic computer. In this paper, we propose a DNA algorithm for solving the vertex-cover problem. It is demonstrated that if the size of a reduced NP-compl...

2013
Pavol Hell Aurosish Mishra

An NP-complete coloring or homomorphism problem may become polynomial time solvable when restricted to graphs with degrees bounded by a small number, but remain NP-complete if the bound is higher. For instance, 3-colorability of graphs with degrees bounded by 3 can be decided by Brooks’ theorem, while for graphs with degrees bounded by 4, the 3-colorability problem is NP-complete. We investigat...

Journal: :Information Processing Letters 2012

Journal: :Discrete Applied Mathematics 2011

Journal: :Discrete & Computational Geometry 2011

Journal: :Journal of Information Processing 2012

Journal: :International Journal of Foundations of Computer Science 2018

Journal: :CoRR 2005
Jeff Stuckman Guo-Qiang Zhang

In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید