Raabnits

ask and answer | learn and let learn

Category: algorithm-analysis

algorithm-analysis 36 Questions

0 Votes 0 Ans

Is there a Linear Transformer which uses only Matrix operations?

88 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

What is the best linear transformer?

69 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

Is the transformer SLiM compatible with ALBERT?

99 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

the convergence of the iterative algorithm has a major problem

87 viewsalgorithm-analysisalgorithm-analysis constraint-satisfaction iteration optimization

0 Votes 0 Ans

Is it possible to run the transformer (performer) SLiM without using GPUs?

69 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

Return indices in the two sum problem

67 viewsalgorithm-analysisalgorithm-analysis big-o-notation searching

0 Votes 0 Ans

How can I optimize the systems in the paper “Ensembling Ten Math Information Retrieval Systems”

74 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

Where is the bottleneck of CompuBERT?

72 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

hash-tables – Expected-time for an unsuccessful search

87 viewsalgorithm-analysisalgorithm-analysis hash hash-tables

0 Votes 0 Ans

trouble solving the recurrence 4T(n/2) + n

82 viewsalgorithm-analysisalgorithm-analysis recurrence-relation recursion runtime-analysis

0 Votes 0 Ans

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

80 viewsalgorithm-analysisalgorithm-analysis ordering runtime-analysis sorting

0 Votes 0 Ans

CLRS Question 8-6 Lower bound on merging sorted lists

87 viewsalgorithm-analysisalgorithm-analysis lower-bounds

0 Votes 0 Ans

with $T(2) = 1$ is asymptotically $O(n)$ ">Proving that the recurrence $T(n) = 2Tleft(frac{n}{2}right) + 1$ with $T(2) = 1$ is asymptotically $O(n)$

81 viewsalgorithm-analysisalgorithm-analysis discrete-mathematics recurrence-relation

0 Votes 0 Ans

Amortized Analysis of extract-min-operation of Fibonacci Heap

90 viewsalgorithm-analysisalgorithm-analysis amortized-analysis

0 Votes 0 Ans

Can I multiply Big-O time complexities?

87 viewsalgorithm-analysisalgorithm-analysis

0 Votes 0 Ans

Differences between Polynomial and fully polynomial time approximation scheme

151 viewsalgorithm-analysisalgorithm-analysis approximation polynomial-time runtime-analysis

0 Votes 0 Ans

Polynomial and fully polynomial time approximation scheme

146 viewsalgorithm-analysisalgorithm-analysis approximation polynomial-time runtime-analysis

0 Votes 0 Ans

Difference between polynomial and fully polynomial time approximation algorithm

147 viewsalgorithm-analysisalgorithm-analysis approximation polynomial-time runtime-analysis

0 Votes 0 Ans

Hiring problem from CLRS

144 viewsalgorithm-analysisalgorithm-analysis combinatorics randomized-algorithms

0 Votes 0 Ans

Finding n0, asymptotic analysis

146 viewsalgorithm-analysisalgorithm-analysis asymptotics big-o-notation

0 Votes 0 Ans

Runtime analysis of prime-set computation

105 viewsalgorithm-analysisalgorithm-analysis runtime-analysis

0 Votes 0 Ans

algorithm analysis – complex dependant nested loop

164 viewsalgorithm-analysisalgorithm-analysis loops runtime-analysis

0 Votes 0 Ans

and $2^{sqrt{log _{2}n}}$ ">Comparing asymptotic running time of two algorithms $sqrt n$ and $2^{sqrt{log _{2}n}}$

152 viewsalgorithm-analysisalgorithm-analysis big-o-notation complexity-classes time-complexity

0 Votes 0 Ans

How to show working for summing of Big O notation

160 viewsalgorithm-analysisalgorithm-analysis asymptotics big-o-notation

0 Votes 0 Ans

is log(n)[base 2] theta of log(n)[base 3]?

151 viewsalgorithm-analysisalgorithm-analysis asymptotics big-o-notation

0 Votes 0 Ans

How do you justify making algorithm subroutines more efficient when Big-O notation only includes the dominant term?

160 viewsalgorithm-analysisalgorithm-analysis semantics

0 Votes 0 Ans

Analysis of straggler in tree-based parallel execution

171 viewsalgorithm-analysisalgorithm-analysis parallel-computing performance

0 Votes 0 Ans

without master theorem">Solving $T(n) = 2T(frac{n}{2}) + nlog(n)$ without master theorem

165 viewsalgorithm-analysisalgorithm-analysis recurrence-relation runtime-analysis

0 Votes 0 Ans

substitution method on T(n) = T(floor(n/2)) + n recurrence

169 viewsalgorithm-analysisalgorithm-analysis recurrence-relation runtime-analysis

0 Votes 0 Ans

How to prove greedy algorithm is correct

161 viewsalgorithm-analysisalgorithm-analysis correctness-proof greedy-algorithms proof-techniques