np-complete

相关标签：javascript jquery android 多少钱 iPhone

Is there any well-known NP-complete problem that I can reduce a 'node placement' problem to?

I have the following NP-complete problem: Given: a set of locations in a N × N field, a set of m nodes, and[详细]

2023-04-10 14:18 分类：问答
Instance of subset sum problem

I have a problem which is a pretty clear instance of the subset sum开发者_StackOverflow problem: \"given a list of Integers in the range [-65000,65000], the function returns true if any subset of the[详细]

2023-04-04 22:34 分类：问答
Is a reduction enough for proving NP-complete or do I need a transformation?

If I have a decision problem开发者_开发技巧 A, and wish to show that it is NP-complete.Is it enough to prove that another NP-complete problem polynomially reduces to A, or must I show that another NP-[详细]

2023-04-04 10:37 分类：问答
Are all NP problems also NP-complete?

The definition of NP-complete is A problem开发者_高级运维 is NP-complete if it belongs to class NP[详细]

2023-04-03 17:15 分类：问答
Minimal addition-chain exponentiation

I know it has been proven NP-complete, and that\'s ok. I\'m currently solving it with branch and bound where I set the initial upper limit at the number of multiplications it would take the normal bin[详细]

2023-04-02 20:52 分类：问答
A very complex problem in reduction notion

I have studied many about reduction but I have a bad problem in it: I take this from CLRS : \" ... by “reducing” solving problem A to solving problem B, we use the “easiness” of B to prove the “[详细]

2023-03-28 22:27 分类：问答
List of problems that are in general NP-hard but have polynomial-time solution in planar graphs?

I encountered many problems that can be formulated as graph problem. It is in general NP-hard but sometimes the graph can be proved to be planar.[详细]

2023-03-14 06:27 分类：问答
Factorial-time algorithms and P/NP

It\'s quite easy to see that n! grows slower than almost anything to the N power (say, 100^N) and so, if a problems is considered NP complete and one happened upon a n! algorithm that approximates the[详细]

2023-03-10 21:05 分类：问答
String to string correction problem np-completeness proof

I have this assignment to prove that this problem: Finite alphabet £, two strings x,y € £*, and a positive integer K.Is[详细]

2023-03-06 09:51 分类：问答
Reduction Algorithm - Recast Any SGI Problem as Subset Sum

Is it possible to cast any subgraph isomorphism problem as a subset sum problem so that it is possible to use dynamic programming techniques av开发者_如何学Goailable for solving the subset sum problem[详细]

2023-03-01 22:10 分类：问答