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

0

votes

1

answer

22

views

Worst Case for AVL Tree Balancing after Deletion

complexity-theory graphs time-complexity balanced-search-trees avl-trees

answered 3 hours ago Dmitry 131

0

votes

2

answers

51

views

Proving complexity of $T(n)=2T(n/3 + 1) + n$ non-Akra-Bazzi

complexity-theory algorithm-analysis time-complexity recurrence-relation master-theorem

answered Jul 8 at 23:12 plshelp 347

0

votes

1

answer

18

views

Complexity of generating power sets

time-complexity complexity-classes

answered Jul 8 at 8:38 nir shahar 1,292

0

votes

1

answer

30

views

What are the $EXP^{NP}$, $EXP^{PSPACE}$, and $EXP^{EXP}$ equal to

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

modified Jul 7 at 23:05 Community♦ 1

0

votes

1

answer

39

views

how to reduce the time complexity?

algorithms graphs time-complexity network-analysis

answered Jul 7 at 21:31 plshelp 347

0

votes

2

answers

25

views

Time Complexity of inserting a vector to a vector of vectors in C++

time-complexity

modified Jul 7 at 14:27 plshelp 347

3

votes

0

answers

54

views

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

time-complexity optimization computational-geometry approximation applied-theory

modified Jul 7 at 5:29 D.W.♦ 122k

1

vote

0

answers

52

views

Finding $l$ subsets such that their intersection has less or equal than $k$ elements NP-complete or in P?

time-complexity np-complete reductions polynomial-time-reductions

modified Jul 6 at 16:03 Pål GD 8,446

2

votes

1

answer

2k

views

Building heaps and heapsort using linked list

algorithms algorithm-analysis data-structures time-complexity heaps

modified Jul 6 at 11:08 Community♦ 1

0

votes

1

answer

33

views

How is the NP verifier polynomial?

time-complexity nondeterminism

modified Jul 6 at 10:07 Community♦ 1

9

votes

7

answers

4k

views

Checking equality of integers: O(1) in C but O(log n) in Python 3?

complexity-theory time-complexity runtime-analysis python c

modified Jul 6 at 9:10 Tom van der Zanden 11.7k

0

votes

0

answers

15

views

Time complexity - Head stay transition - Turing Machine

turing-machines time-complexity computability

modified Jul 5 at 20:34 quetzal94 1

0

votes

1

answer

28

views

Complexity analysis of m!/n!(m-n)!

complexity-theory time-complexity runtime-analysis

modified Jul 5 at 11:38 plop 111

0

votes

1

answer

45

views

Given $n$ unique items and an $m^{th}$ normalised value, compute $m^{th}$ permutation without factorial expansion

algorithms time-complexity computability recurrence-relation permutations

modified Jul 3 at 20:10 NotDijkstra 101

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled