Computer Science Stack Exchange

0 votes

0 answers

17 views

Considering definitions as equalities, what would happen if you continually substituted a word’s definition?

algorithms algorithm-analysis automata

Joseph_Kopp

1

asked May 18 at 4:08

2 votes

1 answer

73 views

Is $m \log^2 n$ complexity too much?

algorithms time-complexity algorithm-analysis

Ashwin Ganesan

1,005

modified May 15 at 3:39

1 vote

1 answer

56 views

Time Complexity of Exponentiation Operation as per RAM Model of Computation

complexity-theory time-complexity algorithm-analysis runtime-analysis computation-models

Matt Groff

835

modified May 14 at 1:55

3 votes

1 answer

177 views

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

algorithms algorithm-analysis amortized-analysis dynamic-array

John L.

33k

modified May 13 at 7:14

2 votes

1 answer

118 views

Sorted list of counters in constant time

algorithms algorithm-analysis sorting counting constant-time

rici

11k

modified May 13 at 3:38

2 votes

0 answers

28 views

Understanding MTD-f

algorithms algorithm-analysis search-algorithms

Andrei

123

modified May 10 at 22:57

0 votes

0 answers

34 views

Arithmetic intensity of matrix multiplication

algorithm-analysis parallel-computing

Yuval Filmus

269k

modified May 10 at 14:40

0 votes

2 answers

260 views

algorithm analysis - complex dependant nested loop

algorithm-analysis runtime-analysis loops

CommunityBot

1

modified May 10 at 8:07

2 votes

1 answer

241 views

Hypothetical Situation for sorting in $O(n)$ using median finding machine that works in $O(\sqrt{n})$

algorithm-analysis runtime-analysis sorting ordering

CommunityBot

1

modified May 10 at 3:07

1 vote

0 answers

22 views

Worst case lower bound of the general number guessing problem

complexity-theory time-complexity algorithm-analysis asymptotics runtime-analysis

Metropola Official

11

modified May 8 at 13:55

0 votes

1 answer

40 views

Polynomial and fully polynomial time approximation scheme

algorithm-analysis runtime-analysis approximation polynomial-time

CommunityBot

1

modified May 8 at 8:07

0 votes

1 answer

16 views

Is $\frac{opt}{c}(1-\epsilon)$ for some constant c >0 considered a PTAS?

complexity-theory algorithm-analysis approximation

Steven

22.7k

modified May 7 at 12:15

0 votes

2 answers

113 views

Θ, O and Ω, and how they relate to each other as subsets

algorithm-analysis asymptotics runtime-analysis discrete-mathematics big-o-notation

D.W.♦

140k

modified May 6 at 17:17

2 votes

1 answer

79 views

Max sum cyclic path of fixed length in matrix

algorithms algorithm-analysis dynamic-programming

CommunityBot

1

modified May 5 at 4:03

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Considering definitions as equalities, what would happen if you continually substituted a word’s definition?

Is $m \log^2 n$ complexity too much?

Time Complexity of Exponentiation Operation as per RAM Model of Computation

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

Sorted list of counters in constant time

Understanding MTD-f

Arithmetic intensity of matrix multiplication

algorithm analysis - complex dependant nested loop

Hypothetical Situation for sorting in $O(n)$ using median finding machine that works in $O(\sqrt{n})$

Worst case lower bound of the general number guessing problem

Polynomial and fully polynomial time approximation scheme

Is $\frac{opt}{c}(1-\epsilon)$ for some constant c >0 considered a PTAS?

Θ, O and Ω, and how they relate to each other as subsets

Max sum cyclic path of fixed length in matrix

Hot Network Questions