Question

Clique enumeration for substring overlap graph surely has polynomial (not exponential) running time.

score 83 · Answer 1 · 2026-03-26 19:17:06

83

Views

Clique enumeration for substring overlap graph surely has polynomial (not exponential) running time.

Published on 26 Mar 2026 - 19:17

score 88 · Answer 2 · 2026-03-25 16:08:36

88

Views

Formula for the derivatives in backpropagation for neural networks?

Published on 25 Mar 2026 - 16:08

score 314 · Answer 3 · 2026-03-25 13:53:35

314

Views

Are there any efficient algorithms for deciding whether a finitely presented group is Abelian?

Published on 25 Mar 2026 - 13:53

score 290 · Answer 4 · 2026-03-25 22:10:16

290

Views

Is this proof of Barendregt's Substitution Lemma (lambda calculus) correct?

Published on 25 Mar 2026 - 22:10

score 9.7k · Answer 5 · 2026-03-26 17:42:13

9.7k

Views

Is Calculus necessary for computer science student?

Published on 26 Mar 2026 - 17:42

score 309 · Answer 6 · 2019-08-12 03:35:10

309

Views

What's "higher level" than type theory as far as implementing a different kind of proof assistant goes?

Published on 12 Aug 2019 - 3:35

score 1.7k · Answer 7 · 2026-03-25 22:04:13

1.7k

Views

Is $n \log n$ = $O(n)$ and is $n log n$ = $\Omega(n)$

Published on 25 Mar 2026 - 22:04

score 9.9k · Answer 8 · 2026-03-22 15:32:57

9.9k

Views

Unsolved Problems due to Lack of Computational Power

Published on 22 Mar 2026 - 15:32

score 521 · Answer 9 · 2026-03-26 01:28:42

521

Views

Is it possible for a calculator to be completely exact?

Published on 26 Mar 2026 - 1:28

score 557 · Answer 10 · 2019-08-18 15:15:33

557

Views

Recursive formula to find the number of natural numbers in which there are no two adjacent even digits.

Published on 18 Aug 2019 - 15:15

score 59 · Answer 11 · 2026-03-25 16:44:27

59

Views

Estructural inductionin

Published on 25 Mar 2026 - 16:44

score 64 · Answer 12 · 2026-03-25 16:00:28

64

Views

Amortized analysis for datastructures having early high cost and then low cost

Published on 25 Mar 2026 - 16:00

score 72 · Answer 13 · 2026-03-28 08:42:36

72

Views

Equivalence relation & partition definitions: IT goal or a mathematical motivation?

Published on 28 Mar 2026 - 8:42

score 116 · Answer 14 · 2026-03-26 17:53:23

116

Views

What is the number of possibilities to choose $~80~$ numbers out of the set $~\{10,11,\cdots,99\}~$ with repetition and no order significant

Published on 26 Mar 2026 - 17:53

score 55 · Answer 15 · 2026-03-25 06:26:42

55

Views

What algorithms are there to partition graphs into bounded-diameter sets?

Published on 25 Mar 2026 - 6:26

List Question

Clique enumeration for substring overlap graph surely has polynomial (not exponential) running time.

Formula for the derivatives in backpropagation for neural networks?

Are there any efficient algorithms for deciding whether a finitely presented group is Abelian?

Is this proof of Barendregt's Substitution Lemma (lambda calculus) correct?

Is Calculus necessary for computer science student?

What's "higher level" than type theory as far as implementing a different kind of proof assistant goes?

Is $n \log n$ = $O(n)$ and is $n log n$ = $\Omega(n)$

Unsolved Problems due to Lack of Computational Power

Is it possible for a calculator to be completely exact?

Recursive formula to find the number of natural numbers in which there are no two adjacent even digits.

Estructural inductionin

Amortized analysis for datastructures having early high cost and then low cost

Equivalence relation & partition definitions: IT goal or a mathematical motivation?

What is the number of possibilities to choose $~80~$ numbers out of the set $~\{10,11,\cdots,99\}~$ with repetition and no order significant

What algorithms are there to partition graphs into bounded-diameter sets?

Trending Questions

Popular # Hahtags

Popular Questions