Question

Modification of the subset sum problem - "perfect coverage" of the set with good solutions

score 104 · Answer 1 · 2026-04-29 12:53:05

104

Views

Modification of the subset sum problem - "perfect coverage" of the set with good solutions

Published on 29 Apr 2026 - 12:53

score 81 · Answer 2 · 2026-05-05 05:31:03

81

Views

Do we need enumeration to find the maximal number of steps a special Turing machine can make?

Published on 05 May 2026 - 5:31

score 66 · Answer 3 · 2026-05-02 18:46:51

66

Views

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

Published on 02 May 2026 - 18:46

score 711 · Answer 4 · 2026-04-29 12:51:09

711

Views

Reduction 3SAT to Subset Sum

Published on 29 Apr 2026 - 12:51

score 58 · Answer 5 · 2026-05-07 10:09:08

58

Views

How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$

Published on 07 May 2026 - 10:09

score 142 · Answer 6 · 2026-05-07 17:03:34

142

Views

Is there any universal algorithm converting grammar to Turing Machine?

Published on 07 May 2026 - 17:03

score 244 · Answer 7 · 2026-05-07 16:52:29

244

Views

Fast solutions for $x^2+y^2+z^2=d^2$ for large $d>1000$

Published on 07 May 2026 - 16:52

score 358 · Answer 8 · 2026-04-29 12:48:17

358

Views

Given array of numbers $n$, what is the probability that at least k elements will have smaller value than arithmetic average?

Published on 29 Apr 2026 - 12:48

score 78 · Answer 9 · 2026-04-29 12:46:24

78

Views

Using the definition of O( big-O), show that 2n $ \in $ O($6n^2$)

Published on 29 Apr 2026 - 12:46

score 392 · Answer 10 · 2026-04-29 12:46:19

392

Views

Using the definition of $O$(big O) show that $6n^2$ $\notin O(2n)$

Published on 29 Apr 2026 - 12:46

score 550 · Answer 11 · 2026-04-12 00:02:59

550

Views

Effective algorithm for subset sum search problem based on decision problem of subset sum

Published on 12 Apr 2026 - 0:02

score 163 · Answer 12 · 2026-05-05 23:13:45

163

Views

Can the halting problem for bounded Turing machines be efficiently decided?

Published on 05 May 2026 - 23:13

score 113 · Answer 13 · 2026-04-29 12:48:38

113

Views

Understanding summation formulas

Published on 29 Apr 2026 - 12:48

score 70 · Answer 14 · 2026-04-14 15:11:47

70

Views

If $f(n) = \Theta(h(n))$, is $h(n) =\Theta(f(n))$?

Published on 14 Apr 2026 - 15:11

score 300 · Answer 15 · 2026-05-04 02:14:37

300

Views

What is the most efficient computation of the permanent?

Published on 04 May 2026 - 2:14

List Question

Modification of the subset sum problem - "perfect coverage" of the set with good solutions

Do we need enumeration to find the maximal number of steps a special Turing machine can make?

is there any set membership of which is not decidable in polynomial time but semidecidable in P?

Reduction 3SAT to Subset Sum

How to get QuickSort algorithm to run in any time between $n\log n$ and $n^2$

Is there any universal algorithm converting grammar to Turing Machine?

Fast solutions for $x^2+y^2+z^2=d^2$ for large $d>1000$

Given array of numbers $n$, what is the probability that at least k elements will have smaller value than arithmetic average?

Using the definition of O( big-O), show that 2n $ \in $ O($6n^2$)

Using the definition of $O$(big O) show that $6n^2$ $\notin O(2n)$

Effective algorithm for subset sum search problem based on decision problem of subset sum

Can the halting problem for bounded Turing machines be efficiently decided?

Understanding summation formulas

If $f(n) = \Theta(h(n))$, is $h(n) =\Theta(f(n))$?

What is the most efficient computation of the permanent?

Trending Questions

Popular # Hahtags

Popular Questions