Question

Implementation of distributed greedy algorithm for finding maximum independent set

score 68 · Answer 1 · 2024-02-05T16:00:44.563000

68

Views

Implementation of distributed greedy algorithm for finding maximum independent set

Published on 05 February 2024 at 16:00

score 74 · Answer 2 · 2023-12-18T14:27:15.483000

74

Views

K-Hamiltonian Path problem and NP-completeness

Published on 18 December 2023 at 14:27

score 66 · Answer 3 · 2023-12-09T19:58:40.083000

66

Views

Computational Learning Problem: 3-DNF Reduction

Published on 09 December 2023 at 19:58

score 207 · Answer 4 · 2023-09-16T03:07:12.830000

207

Views

Distributing marbles into buckets for maximal colour sharing

Published on 16 September 2023 at 03:07

score 22 · Answer 5 · 2023-06-10T04:39:58.580000

22

Views

Get all subsets of fairly large set of elements, {1,2,3,...,254,255}, that sum up to a value 666

Published on 10 June 2023 at 04:39

score 217 · Answer 6 · 2023-06-06T12:39:56.567000

217

Views

3 partition np completeness

Published on 06 June 2023 at 12:39

score 87 · Answer 7 · 2023-05-22T17:24:00.877000

87

Views

P=NP in Exponential Space?

Published on 22 May 2023 at 17:24

score 37 · Answer 8 · 2023-04-24T16:49:19.873000

37

Views

AMPL variable in such-that part of set specification

Published on 24 April 2023 at 16:49

score 29 · Answer 9 · 2023-02-26T06:25:59.287000

29

Views

Best practice to search for a list of subset holders that holds a subset of a complete set?

Published on 26 February 2023 at 06:25

score 114 · Answer 10 · 2022-10-05T14:17:06.583000

114

Views

Judge:Some N P -complete problems have polynomial time algorithms, but some others do not

Published on 05 October 2022 at 14:17

score 393 · Answer 11 · 2022-10-02T12:18:18.573000

393

Views

Independent Set with dist(u, w) > 2

Published on 02 October 2022 at 12:18

score 65 · Answer 12 · 2022-08-18T04:35:31.633000

65

Views

proof of SAT np completeness

Published on 18 August 2022 at 04:35

score 61 · Answer 13 · 2022-08-12T02:17:59.933000

61

Views

What problem type the Power Set belong to?

Published on 12 August 2022 at 02:17

score 79 · Answer 14 · 2022-06-18T17:55:20.190000

79

Views

Are these two definitions of an NP-Complete problem equivalent?

Published on 18 June 2022 at 17:55

score 33 · Answer 15 · 2022-05-06T05:46:10.630000

33

Views

What would be considered the number of elements in a boolean satisfiability problem?

Published on 06 May 2022 at 05:46

score 286 · Answer 16 · 2022-04-30T14:20:20.983000

286

Views

Is it NP-complete to find a sub-maximal clique which is at least max clique size - 1?

Published on 30 April 2022 at 14:20

score 226 · Answer 17 · 2022-04-25T20:05:54.337000

226

Views

Is there an optimization problem that is NP-Complete?

Published on 25 April 2022 at 20:05

score 1.2k · Answer 18 · 2022-02-10T05:59:40.383000

1.2k

Views

How to approach the k-Processor Scheduling Problem?

Published on 10 February 2022 at 05:59

score 196 · Answer 19 · 2022-01-28T10:24:03.940000

196

Views

Why cant we use algorithm to find all cycles to find an hamiltonian cycle?

Published on 28 January 2022 at 10:24

score 678 · Answer 20 · 2022-01-10T20:33:28.577000

678

Views

Strategy for reducing CNF-SAT to this problem

Published on 10 January 2022 at 20:33

List Question

Implementation of distributed greedy algorithm for finding maximum independent set

K-Hamiltonian Path problem and NP-completeness

Computational Learning Problem: 3-DNF Reduction

Distributing marbles into buckets for maximal colour sharing

Get all subsets of fairly large set of elements, {1,2,3,...,254,255}, that sum up to a value 666

3 partition np completeness

P=NP in Exponential Space?

AMPL variable in such-that part of set specification

Best practice to search for a list of subset holders that holds a subset of a complete set?

Judge:Some N P -complete problems have polynomial time algorithms, but some others do not

Independent Set with dist(u, w) > 2

proof of SAT np completeness

What problem type the Power Set belong to?

Are these two definitions of an NP-Complete problem equivalent?

What would be considered the number of elements in a boolean satisfiability problem?

Is it NP-complete to find a sub-maximal clique which is at least max clique size - 1?

Is there an optimization problem that is NP-Complete?

How to approach the k-Processor Scheduling Problem?

Why cant we use algorithm to find all cycles to find an hamiltonian cycle?

Strategy for reducing CNF-SAT to this problem

Trending Questions

Popular # Hahtags

Popular Questions