Question

Are there any examples of "Easy" Problems in EXPTIME(ie problems with small exponents)

score 162 · Answer 1 · 2026-04-13 00:18:48

162

Views

Are there any examples of "Easy" Problems in EXPTIME(ie problems with small exponents)

Published on 13 Apr 2026 - 0:18

score 37 · Answer 2 · 2026-04-10 05:30:12

37

Views

Atkin sieve algorithm asymptotic analysis

Published on 10 Apr 2026 - 5:30

score 99 · Answer 3 · 2022-02-18 19:35:30

99

Views

Determine Big-O of complex functions

Published on 18 Feb 2022 - 19:35

score 40 · Answer 4 · 2026-04-12 18:23:06

40

Views

Multiplying positive integers - smaller ones first?

Published on 12 Apr 2026 - 18:23

score 466 · Answer 5 · 2022-02-22 11:30:56

466

Views

What's the degree of the polynomial function $f(n) = n \log n$?

Published on 22 Feb 2022 - 11:30

score 321 · Answer 6 · 2026-03-28 10:01:35

321

Views

Finding a subgraph satisfying degree constraints in a directed graph

Published on 28 Mar 2026 - 10:01

score 281 · Answer 7 · 2026-03-28 06:41:00

281

Views

Why aren't the eigenvectors of a graph's adjacency matrix useful for the graph isomorphism problem?

Published on 28 Mar 2026 - 6:41

score 55 · Answer 8 · 2026-04-09 11:44:26

55

Views

which one is more computationally intensive?

Published on 09 Apr 2026 - 11:44

score 40 · Answer 9 · 2022-03-04 23:03:59

40

Views

Why is m + k log m = O(m + k log k)?

Published on 04 Mar 2022 - 23:03

score 161 · Answer 10 · 2026-04-12 23:02:32

161

Views

Sit N people around a table so as to minimize the maximum difference in height between any two adjacent people

Published on 12 Apr 2026 - 23:02

score 185 · Answer 11 · 2026-04-04 11:13:27

185

Views

Using substitution method solve the recurrence $T(n) = 3T(\frac{n}{3}) + \frac{n}{(\log n)}$

Published on 04 Apr 2026 - 11:13

score 67 · Answer 12 · 2026-04-13 12:17:38

67

Views

What families of graphs is the subgraph isomorphism problem known to remain NP-complete?

Published on 13 Apr 2026 - 12:17

score 425 · Answer 13 · 2026-03-30 04:26:19

425

Views

Turing machine, alphabet: $\{0,1\}$, accepts any word $w$, and on the tape the word $w$ is written followed by $0$-s as the number of the $1$-s in $w$

Published on 30 Mar 2026 - 4:26

score 166 · Answer 14 · 2022-03-09 17:20:47

166

Views

Runtime of a nested Loop with increment 3

Published on 09 Mar 2022 - 17:20

score 98 · Answer 15 · 2026-04-12 19:20:45

98

Views

Unclear about the definitions of $P$ and $NP$

Published on 12 Apr 2026 - 19:20

List Question

Are there any examples of "Easy" Problems in EXPTIME(ie problems with small exponents)

Atkin sieve algorithm asymptotic analysis

Determine Big-O of complex functions

Multiplying positive integers - smaller ones first?

What's the degree of the polynomial function $f(n) = n \log n$?

Finding a subgraph satisfying degree constraints in a directed graph

Why aren't the eigenvectors of a graph's adjacency matrix useful for the graph isomorphism problem?

which one is more computationally intensive?

Why is m + k log m = O(m + k log k)?

Sit N people around a table so as to minimize the maximum difference in height between any two adjacent people

Using substitution method solve the recurrence $T(n) = 3T(\frac{n}{3}) + \frac{n}{(\log n)}$

What families of graphs is the subgraph isomorphism problem known to remain NP-complete?

Turing machine, alphabet: $\{0,1\}$, accepts any word $w$, and on the tape the word $w$ is written followed by $0$-s as the number of the $1$-s in $w$

Runtime of a nested Loop with increment 3

Unclear about the definitions of $P$ and $NP$

Trending Questions

Popular # Hahtags

Popular Questions