Question

If unary subset sum problem is in P, why isn't the regular subset sum problem? Couldn't you just solve it the same way as the unary one?

score 61 · Answer 1 · 2023-06-24 13:27:31

If unary subset sum problem is in P, why isn't the regular subset sum problem? Couldn't you just solve it the same way as the unary one?

score 146 · Answer 2 · 2026-03-25 11:17:18

146

Views

Efficiency of RREF algorithms

Published on 25 Mar 2026 - 11:17

score 22 · Answer 3 · 2026-03-28 08:46:17

22

Views

Need polynomial time implementation for pycddlib polyhedra representation.

Published on 28 Mar 2026 - 8:46

score 41 · Answer 4 · 2023-06-26 10:46:40

41

Views

Counterintuitive result while computing Kolmogorov Complexity

Published on 26 Jun 2023 - 10:46

score 23 · Answer 5 · 2026-03-26 12:33:40

23

Views

Construct NP-complete languages A and B such that A ∪ B = {0, 1}*

Published on 26 Mar 2026 - 12:33

score 50 · Answer 6 · 2026-03-26 12:38:28

50

Views

Prove that the language HAMTWOCYCLES = {G | there exist two cycles in G such that any vertex belongs to exactly one of them} is NP-complete

Published on 26 Mar 2026 - 12:38

score 66 · Answer 7 · 2023-07-06 12:19:06

66

Views

Approximation of $\left(1-\frac{k}{n}\right)^{k}$ where $k=o(\sqrt{n})$

Published on 06 Jul 2023 - 12:19

score 99 · Answer 8 · 2026-03-31 11:23:20

99

Views

Amortized analysis insert operation on linked list required in O(1) amortized

Published on 31 Mar 2026 - 11:23

score 95 · Answer 9 · 2026-03-27 03:59:16

95

Views

Prove that NP ∩ co-NP closed under concatenation

Published on 27 Mar 2026 - 3:59

score 21 · Answer 10 · 2023-07-09 07:27:26

21

Views

Meta-Heuristic Algorithm

Published on 09 Jul 2023 - 7:27

score 24 · Answer 11 · 2026-03-27 04:00:02

24

Views

Is the average number of steps of a $n$-state $k$-symbol Turing uncomputable?

Published on 27 Mar 2026 - 4:00

score 24 · Answer 12 · 2026-03-25 11:18:12

24

Views

Dual simplex computational feasibility when applied to primal problems with many bound variables

Published on 25 Mar 2026 - 11:18

score 604 · Answer 13 · 2023-07-12 09:26:00

604

Views

Time complexity for subset sum problem with fixed size subset and only positive integers

Published on 12 Jul 2023 - 9:26

score 66 · Answer 14 · 2023-07-14 01:36:29

66

Views

Show that the sets of local minima vertices in a graph, when each vertex chooses a value uniformly at random, is a $(2,O(\log n))$ ruling set

Published on 14 Jul 2023 - 1:36

score 55 · Answer 15 · 2023-07-14 17:45:38

55

Views

Time complexity of taking duplicates out of a set

Published on 14 Jul 2023 - 17:45

List Question

If unary subset sum problem is in P, why isn't the regular subset sum problem? Couldn't you just solve it the same way as the unary one?

Efficiency of RREF algorithms

Need polynomial time implementation for pycddlib polyhedra representation.

Counterintuitive result while computing Kolmogorov Complexity

Construct NP-complete languages A and B such that A ∪ B = {0, 1}*

Prove that the language HAMTWOCYCLES = {G | there exist two cycles in G such that any vertex belongs to exactly one of them} is NP-complete

Approximation of $\left(1-\frac{k}{n}\right)^{k}$ where $k=o(\sqrt{n})$

Amortized analysis insert operation on linked list required in O(1) amortized

Prove that NP ∩ co-NP closed under concatenation

Meta-Heuristic Algorithm

Is the average number of steps of a $n$-state $k$-symbol Turing uncomputable?

Dual simplex computational feasibility when applied to primal problems with many bound variables

Time complexity for subset sum problem with fixed size subset and only positive integers

Show that the sets of local minima vertices in a graph, when each vertex chooses a value uniformly at random, is a $(2,O(\log n))$ ruling set

Time complexity of taking duplicates out of a set

Trending Questions

Popular # Hahtags

Popular Questions