MATH
Login Or Sign up

List Question

15
57
Views

What is the complexity of $T(n) =3T((n-2)/2) + n^2$?

Published on
#computational-complexity
307
Views

How can one prove the worst case scenario of an algorithm purely mathematically?

Published on
#proof-writing #computational-complexity #recursive-algorithms
464
Views

How is the AKS primality test Rosetta code so simple?

Published on
#prime-numbers #algorithms #computer-science #computational-complexity #primality-test
74
Views

Complexity of a variant of FFT

Published on
#computational-complexity #fast-fourier-transform
378
Views

Big Omega and Big Omega Infinity Differences

Published on
#discrete-mathematics #algorithms #computational-complexity
57
Views

np hard and np complete simple question

Published on
#algorithms #computer-science #computational-complexity #np-complete
1.1k
Views

Circle intersections algorithm with $O((n+s)\log(n))$ complexity

Published on
#geometry #computational-complexity
215
Views

NP, NP-complete and Reducibility

Published on
#computer-science #computational-complexity #computability #np-complete #decidability
56
Views

Solvability of System of Linear Inequations

Published on
#inequality #algorithms #computational-complexity
23
Views

Proving $\{(C,x): C(x) = 1 \ \ \text{and} \ \ C \ \ \text{is monotone}\}$ is P-complete

Published on
#computer-science #computational-complexity #np-complete
37
Views

Simplification of gradient computation form $O(n^2)$ to $O(n)$

Published on
#derivatives #matrix-equations #computational-complexity #chain-rule
52
Views

Two problems related to NP-Hard and why they are true?

Published on
#computer-science #computational-complexity #computational-mathematics #turing-machines #np-complete
195
Views

Is $L=\{\,a^ib^jc^k \mid i=2j=3k\, \}$ a Turing language?

Published on
#computational-complexity #automata #context-free-grammar #turing-machines
28
Views

Complexity of numerical differentiation n times

Published on
#numerical-methods #computational-complexity
40
Views

Prove that running time T(n)=$(n + a)^b$ is $O(n^b)$ with a and b > 0

Published on
#notation #asymptotics #computational-complexity #binomial-theorem

Trending Questions

Popular # Hahtags

second-order-logic numerical-methods puzzle logic probability number-theory winding-number real-analysis integration calculus complex-analysis sequences-and-series proof-writing set-theory functions homotopy-theory elementary-number-theory ordinary-differential-equations circles derivatives game-theory definite-integrals elementary-set-theory limits multivariable-calculus geometry algebraic-number-theory proof-verification partial-derivative algebra-precalculus

Popular Questions

Copyright © 2021 JogjaFile Inc.