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

more tags

Active 1 Bountied Hot Week Month

0

votes

0

answers

15

views

multiset variant of subset sum problem known algorithms

algorithms time-complexity subset-sum

asked 13 hours ago John Seppard 27

5

votes

1

answer

309

views

Find all values repeating more than $\lfloor n/k \rfloor$ times in $O(n \log k)$ time

algorithms data-structures time-complexity

modified 21 hours ago rici 5,376

1

vote

2

answers

201

views

Algorithm for scheduling unit time tasks with arrival times and deadlines

algorithms time-complexity scheduling

modified 22 hours ago Community♦ 1

1

vote

2

answers

283

views

Why is Dijkstra's Algorithm more popular compared to Grassfire algorithm?

algorithms graphs time-complexity shortest-path greedy-algorithms

answered yesterday D.W.♦ 106k

0

votes

1

answer

22

views

Grassfire vs BFS

algorithms time-complexity search-algorithms

answered yesterday J. Schmidt 155

0

votes

0

answers

30

views

Language with one word not in P

complexity-theory time-complexity

asked 2 days ago Ringminustwo 1

5

votes

1

answer

113

views

How to maintain completely dynamic convex hull quickly?

data-structures time-complexity computational-geometry

answered Sep 15 at 23:49 jbapple 2,953

0

votes

0

answers

24

views

Impossible recurrence relation help with masters theorem, plus evaluation of complexity

algorithms time-complexity

asked Sep 15 at 10:03 AndrewM 1

0

votes

0

answers

13

views

In the right-rotation case for red-black trees, there is a less efficient way to recolor it, why is it not O(log(n)) anymore?

time-complexity b-tree red-black-trees

asked Sep 14 at 20:20 Materia Gravis 1

0

votes

1

answer

29

views

Is this computational complexity of the k-NN (custom distance) correct?

complexity-theory time-complexity asymptotics nearest-neighbour

modified Sep 14 at 2:01 Community♦ 1

3

votes

1

answer

105

views

“Fuzzy” Chinese Remainder Theorem

time-complexity

modified Sep 13 at 23:02 Community♦ 1

1

vote

2

answers

40

views

What are some decidable problems which cannot be solved in real life(due to time and memory constraints)?

time-complexity undecidability space-complexity

answered Sep 13 at 6:33 gnasher729 14.7k

0

votes

0

answers

19

views

Time complexity of simple function related to bits

algorithms algorithm-analysis time-complexity asymptotics runtime-analysis

asked Sep 11 at 23:23 weno 101

4

votes

1

answer

281

views

Oracle Turing Machine EXP^EXP

complexity-theory time-complexity complexity-classes oracle-machines

modified Sep 11 at 4:07 xskxzr 5,072

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled