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 4 Bountied Hot Week Month

1

vote

1

answer

40

views

Finding minimum in PRAM model

algorithms time-complexity parallel-computing pram

modified 3 hours ago D.W.♦ 111k

4

votes

2

answers

479

views

Are there any proofs of exponnential lower bound time complexity

complexity-theory time-complexity decision-problem

answered 5 hours ago jbell 1

0

votes

0

answers

5

views

Summation of asymptotic notation

time-complexity asymptotics approximation big-o-notation

asked 8 hours ago mbhatti_20 1

0

votes

0

answers

4

views

time complexity turing machine equal to “n + 1”

turing-machines time-complexity

asked 9 hours ago Gianni Spear 141

0

votes

4

answers

36

views

Why is finding the closest pair of points by brute force search O(n^2)?

algorithms time-complexity

answered 17 hours ago Anwar Saiah 185

15

votes

3

answers

3k

views

Why not to take the unary representation of numbers in numeric algorithms?

complexity-theory algorithm-analysis time-complexity polynomial-time pseudo-polynomial

answered yesterday Travis Wells 199

0

votes

1

answer

21

views

Determine if an NFA accepts infinite language in polynomial time

time-complexity regular-languages finite-automata

answered 2 days ago D.W.♦ 111k

1

vote

1

answer

33

views

Time Complexity: Big-O

time-complexity

answered 2 days ago Yuval Filmus 212k

2

votes

1

answer

23

views

Conditions under which the 3-partition problem is not strongly NP-complete?

time-complexity np-complete combinatorics partitions

answered Nov 16 at 2:08 narek Bojikian 1,861

2

votes

0

answers

88

views

+100

Time Complexity for Nearest Neighbor Searches in kd-trees

algorithm-analysis time-complexity runtime-analysis search-trees nearest-neighbour

modified Nov 15 at 22:26 user1494080 361

0

votes

1

answer

24

views

Upper bound for runtime complexity of LOOP programs

algorithms time-complexity runtime-analysis upper-bound

answered Nov 13 at 23:41 gnasher729 15.8k

2

votes

1

answer

81

views

Can we solve this problem more efficiently than trying all possible combinations

algorithms complexity-theory time-complexity strings

modified Nov 13 at 21:21 narek Bojikian 1,861

1

vote

1

answer

21

views

Special case of the $MST-$ Problem

graphs time-complexity minimum-spanning-tree

modified Nov 13 at 21:10 narek Bojikian 1,861

0

votes

0

answers

26

views

sequence of insert and delete operation in (2,3)-tree

time-complexity runtime-analysis

asked Nov 13 at 18:51 ITIS 1

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled