Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active 2 Bountied Hot Week Month

2

votes

1

answer

23

views

Is it true that $f(n) = c\cdot g(n) + O(g(n))$ implies $f(n) = O(g(n))$?

time-complexity asymptotics big-o-notation

modified 45 mins ago zkutch 183

0

votes

2

answers

38

views

Choosing Constant for Last Step in Substitution METHOD $T(n)= 5T(n/4) + n^2$

time-complexity asymptotics recurrence-relation

answered yesterday zkutch 183

1

vote

0

answers

25

views

A genral Turing model with one tape to define sublinear space (L,NL,..)

turing-machines time-complexity space-complexity definitions

modified yesterday rl1 143

5

votes

1

answer

69

views

Maximize area of light with 4 light sources on a diagram of a room

time-complexity optimization computational-geometry approximation applied-theory

modified 2 days ago HEKTO 2,400

2

votes

3

answers

57

views

Determining the number of iterations needed to find the number of bits in an integer

time-complexity bit-manipulation

modified Sep 19 at 14:37 recursive 101

1

vote

1

answer

41

views

Using Subset Sum algorithm $O(n)$ times to find the subset

algorithms time-complexity dynamic-programming recursion

modified Sep 18 at 8:03 Community♦ 1

0

votes

1

answer

267

views

Is time complexity of the greedy set cover algorithm cubic?

time-complexity set-cover

modified Sep 17 at 20:06 Community♦ 1

1

vote

1

answer

56

views

What is $f(n)$ in $NTIME(n)\subseteq DTIME(f(n))$ if $CIRCUITSAT$ is in $P$?

complexity-theory time-complexity nondeterminism polynomial-time circuits

modified Sep 17 at 19:06 Community♦ 1

0

votes

1

answer

25

views

Making an algorithm that picks a unique random number in fixed set more efficient

algorithms time-complexity efficiency random-number-generator

answered Sep 17 at 6:24 D.W.♦ 124k

1

vote

1

answer

22

views

Lowest complexity - Number closest to 0

algorithms complexity-theory time-complexity

answered Sep 15 at 12:35 Tassle 1,547

1

vote

2

answers

135

views

Time complexity of pairs in array double loop

time-complexity asymptotics big-o-notation

answered Sep 13 at 12:21 zkutch 183

0

votes

3

answers

94

views

Sum rule for Big-O with equal complexity-functions?

time-complexity big-o-notation

answered Sep 13 at 3:31 zkutch 183

1

vote

2

answers

390

views

Algorithm for scheduling unit time tasks with arrival times and deadlines

algorithms time-complexity scheduling

modified Sep 12 at 16:06 Community♦ 1

1

vote

1

answer

35

views

Big-O of iterating through nested structure

time-complexity big-o-notation

answered Sep 11 at 19:34 Yuval Filmus 232k

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled