Question

NP-hard algorithm

score 1.1k · Answer 1 · 2024-12-30 01:31:42

1.1k

Views

NP-hard algorithm

Published on 30 December 2024 at 01:31

score 1k · Answer 2 · 2025-01-06 08:14:41

1k

Views

example of reduction a polynomial decision to an NP-complete

Published on 06 January 2025 at 08:14

score 22.5k · Answer 3 · 2024-12-27 17:14:04

22.5k

Views

NP-Complete VS NP-Hard

Published on 27 December 2024 at 17:14

score 1.3k · Answer 4 · 2025-01-05 06:36:18

1.3k

Views

Is longest possibly non-simple path in NP?

Published on 05 January 2025 at 06:36

score 1.8k · Answer 5 · 2024-12-30 01:31:41

1.8k

Views

Parabolic knapsack

Published on 30 December 2024 at 01:31

score 440 · Answer 6 · 2024-12-30 02:18:27

440

Views

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

Published on 30 December 2024 at 02:18

score 186 · Answer 7 · 2025-01-02 16:44:58

186

Views

How to schedule different types of planks to form bridges

Published on 02 January 2025 at 16:44

score 835 · Answer 8 · 2024-12-30 02:15:31

835

Views

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

Published on 30 December 2024 at 02:15

score 483 · Answer 9 · 2024-12-28 22:17:19

483

Views

Np-hardness reduction

Published on 28 December 2024 at 22:17

score 353 · Answer 10 · 2025-01-05 06:35:48

353

Views

Complexity measurement of NP-complete

Published on 05 January 2025 at 06:35

score 2.3k · Answer 11 · 2025-01-05 06:38:43

2.3k

Views

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

Published on 05 January 2025 at 06:38

score 45 · Answer 12 · 2024-12-30 01:47:20

45

Views

Example of 3CNF to Hitting set conversion

Published on 30 December 2024 at 01:47

score 63 · Answer 13 · 2024-12-29 17:00:38

63

Views

Maximum independet set of size >= |E|

Published on 29 December 2024 at 17:00

score 105 · Answer 14 · 2024-12-30 02:17:40

105

Views

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

Published on 30 December 2024 at 02:17

score 273 · Answer 15 · 2024-12-30 01:32:01

273

Views

Is this NP-Complete

Published on 30 December 2024 at 01:32

score 376 · Answer 16 · 2024-12-30 01:43:40

376

Views

Specifying Constraints in Networkx-Metis

Published on 30 December 2024 at 01:43

score 195 · Answer 17 · 2024-12-30 01:57:59

195

Views

Is there an optimization problem that is NP-Complete?

Published on 30 December 2024 at 01:57

score 77 · Answer 18 · 2024-12-30 02:09:09

77

Views

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

Published on 30 December 2024 at 02:09

score 59 · Answer 19 · 2025-01-03 00:47:57

59

Views

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

Published on 03 January 2025 at 00:47

score 1k · Answer 20 · 2024-12-30 02:09:08

1k

Views

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

Published on 30 December 2024 at 02:09

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