Question

NP-hard algorithm

score 1k · Answer 1 · 2015-06-24 10:50:12

1k

Views

NP-hard algorithm

Published on 24 June 2015 at 10:50

score 983 · Answer 2 · 2014-11-18 13:16:53

983

Views

example of reduction a polynomial decision to an NP-complete

Published on 18 November 2014 at 13:16

score 22.4k · Answer 3 · 2013-12-11 15:46:35

22.4k

Views

NP-Complete VS NP-Hard

Published on 11 December 2013 at 15:46

score 1.2k · Answer 4 · 2011-02-20 22:41:51

1.2k

Views

Is longest possibly non-simple path in NP?

Published on 20 February 2011 at 22:41

score 1.7k · Answer 5 · 2011-02-22 22:32:47

1.7k

Views

Parabolic knapsack

Published on 22 February 2011 at 22:32

score 404 · Answer 6 · 2013-08-27 10:19:11

404

Views

Are there any decision problems in NP-Hard whose solution is not verifiable in polynomial time?

Published on 27 August 2013 at 10:19

score 141 · Answer 7 · 2013-09-10 14:55:23

141

Views

How to schedule different types of planks to form bridges

Published on 10 September 2013 at 14:55

score 799 · Answer 8 · 2020-10-21 07:24:55

799

Views

Recursively finding all partitions of a set of n objects into k non-empty subsets

Published on 21 October 2020 at 07:24

score 443 · Answer 9 · 2012-01-09 13:30:10

443

Views

Np-hardness reduction

Published on 09 January 2012 at 13:30

score 313 · Answer 10 · 2014-01-06 07:33:44

313

Views

Complexity measurement of NP-complete

Published on 06 January 2014 at 07:33

score 2.3k · Answer 11 · 2014-01-08 20:18:39

2.3k

Views

How can some NP-Complete problems be also NP-Hard?

Published on 08 January 2014 at 20:18

score 35 · Answer 12 · 2023-10-14 13:17:45

35

Views

Example of 3CNF to Hitting set conversion

Published on 14 October 2023 at 13:17

score 25 · Answer 13 · 2023-11-14 14:35:30

25

Views

Maximum independet set of size >= |E|

Published on 14 November 2023 at 14:35

score 95 · Answer 14 · 2023-11-18 20:16:12

95

Views

Constructing result for given word's order and overlapping in Shortest Superstring Problem

Published on 18 November 2023 at 20:16

score 263 · Answer 15 · 2012-06-07 21:03:23

263

Views

Is this NP-Complete

Published on 07 June 2012 at 21:03

score 339 · Answer 16 · 2020-12-03 20:36:39

339

Views

Specifying Constraints in Networkx-Metis

Published on 03 December 2020 at 20:36

score 188 · Answer 17 · 2022-04-25 20:05:54

188

Views

Is there an optimization problem that is NP-Complete?

Published on 25 April 2022 at 20:05

score 68 · Answer 18 · 2022-05-06 10:20:17

68

Views

Reasonable neighbours for a bees algorithm on a not-complete digraph

Published on 06 May 2022 at 10:20

score 46 · Answer 19 · 2021-04-15 06:20:30

46

Views

Does solving a NP-hard problem in polynomial time make it NP-complete?

Published on 15 April 2021 at 06:20

score 1k · Answer 20 · 2018-11-11 16:41:43

1k

Views

Prove a problem that is NP-hard and not NP-complete in not in P

Published on 11 November 2018 at 16:41

List Question

NP-hard algorithm

example of reduction a polynomial decision to an NP-complete

NP-Complete VS NP-Hard

Is longest possibly non-simple path in NP?

Parabolic knapsack

Are there any decision problems in NP-Hard whose solution is not verifiable in polynomial time?

How to schedule different types of planks to form bridges

Recursively finding all partitions of a set of n objects into k non-empty subsets

Np-hardness reduction

Complexity measurement of NP-complete

How can some NP-Complete problems be also NP-Hard?

Example of 3CNF to Hitting set conversion

Maximum independet set of size >= |E|

Constructing result for given word's order and overlapping in Shortest Superstring Problem

Is this NP-Complete

Specifying Constraints in Networkx-Metis

Is there an optimization problem that is NP-Complete?

Reasonable neighbours for a bees algorithm on a not-complete digraph

Does solving a NP-hard problem in polynomial time make it NP-complete?

Prove a problem that is NP-hard and not NP-complete in not in P

Trending Questions

Popular # Hahtags

Popular Questions