Question

Set cover: To show the number of minimum coverable combination of the power set of universe $U$ is less than $2^n$

score 70 · Answer 1 · 2018-07-29 05:33:33

70

Views

Set cover: To show the number of minimum coverable combination of the power set of universe $U$ is less than $2^n$

Published on 29 Jul 2018 - 5:33

score 45 · Answer 2 · 2026-03-25 15:47:06

45

Views

What's the generic-case complexity of the Halting Problem on LBAs?

Published on 25 Mar 2026 - 15:47

score 642 · Answer 3 · 2018-08-08 12:55:30

642

Views

How to iterate through large sets of numbers efficiently?

Published on 08 Aug 2018 - 12:55

score 100 · Answer 4 · 2018-08-24 01:15:34

100

Views

Additivity properties of asymptotic bounds

Published on 24 Aug 2018 - 1:15

score 54 · Answer 5 · 2018-08-24 16:45:11

54

Views

Help solve Recurrence Relation $T(n)=3\cdot T\left(n/2\right)+\Theta(n)$

Published on 24 Aug 2018 - 16:45

score 130 · Answer 6 · 2018-08-25 09:17:17

130

Views

Projection on affine subset without inversion

Published on 25 Aug 2018 - 9:17

score 173 · Answer 7 · 2026-03-25 15:56:53

173

Views

Compare Calculation-time for two methods

Published on 25 Mar 2026 - 15:56

score 35 · Answer 8 · 2018-08-26 11:17:21

35

Views

Missing basis step while solving a recurrence inductively

Published on 26 Aug 2018 - 11:17

score 90 · Answer 9 · 2018-08-27 18:13:20

90

Views

Will an optimal algorithm halt when it has read enough of the input to generate a correct answer?

Published on 27 Aug 2018 - 18:13

score 46 · Answer 10 · 2026-03-25 14:21:18

46

Views

Evaluating an elementry symmetric polynomial at some specific points.

Published on 25 Mar 2026 - 14:21

score 1.7k · Answer 11 · 2018-08-29 17:34:01

1.7k

Views

Hierarchy of functions by asymptotic growth

Published on 29 Aug 2018 - 17:34

score 45 · Answer 12 · 2018-09-01 21:15:22

45

Views

How to deal with sum of $4^i$, from i to n, when the base isn't $2$?

Published on 01 Sep 2018 - 21:15

score 206 · Answer 13 · 2018-09-02 21:55:21

206

Views

combinatorics: a variant of set covering/subset selection problem?

Published on 02 Sep 2018 - 21:55

score 171 · Answer 14 · 2018-09-03 04:57:11

171

Views

Big-O notation and algos, what exactly is f and g?

Published on 03 Sep 2018 - 4:57

score 43 · Answer 15 · 2018-09-05 04:23:14

43

Views

Halting behavior of optimal algorithms on getting enough input

Published on 05 Sep 2018 - 4:23

List Question

Set cover: To show the number of minimum coverable combination of the power set of universe $U$ is less than $2^n$

What's the generic-case complexity of the Halting Problem on LBAs?

How to iterate through large sets of numbers efficiently?

Additivity properties of asymptotic bounds

Help solve Recurrence Relation $T(n)=3\cdot T\left(n/2\right)+\Theta(n)$

Projection on affine subset without inversion

Compare Calculation-time for two methods

Missing basis step while solving a recurrence inductively

Will an optimal algorithm halt when it has read enough of the input to generate a correct answer?

Evaluating an elementry symmetric polynomial at some specific points.

Hierarchy of functions by asymptotic growth

How to deal with sum of $4^i$, from i to n, when the base isn't $2$?

combinatorics: a variant of set covering/subset selection problem?

Big-O notation and algos, what exactly is f and g?

Halting behavior of optimal algorithms on getting enough input

Trending Questions

Popular # Hahtags

Popular Questions