Question

Claim about Turing machines

score 631 · Answer 1 · 2026-03-26 18:30:08

631

Views

Claim about Turing machines

Published on 26 Mar 2026 - 18:30

score 228 · Answer 2 · 2026-03-25 19:05:24

228

Views

A Combinatorial Problem on Families of Subsets of $[n]$

Published on 25 Mar 2026 - 19:05

score 145 · Answer 3 · 2026-03-26 09:39:14

145

Views

Finding regular language and DFA for equation $(2)$

Published on 26 Mar 2026 - 9:39

score 1.2k · Answer 4 · 2017-01-02 15:05:35

1.2k

Views

Counting the total number of possible passwords

Published on 02 Jan 2017 - 15:05

score 280 · Answer 5 · 2026-03-29 10:48:58

280

Views

Prove that if $\quad\max\{\text{size(t.left),size(t.right)\}}\leqslant 2/3\text{ size(t)}\}$ than the height of T is $O(\log n)$

Published on 29 Mar 2026 - 10:48

score 609 · Answer 6 · 2017-01-03 05:22:38

609

Views

Minimum number of triangles in triangulation of points in general position

Published on 03 Jan 2017 - 5:22

score 992 · Answer 7 · 2017-01-05 01:20:31

992

Views

permutation and combinations discrete mathematics

Published on 05 Jan 2017 - 1:20

score 161 · Answer 8 · 2026-03-29 17:31:33

161

Views

Unlimited register machine "bounded-accepts", recursively enumerable.

Published on 29 Mar 2026 - 17:31

score 362 · Answer 9 · 2026-03-29 19:11:11

362

Views

Two recursively enumerable sets $A$ and $B$ such that none of union, intersection, one subtracting the other is recursive?

Published on 29 Mar 2026 - 19:11

score 63 · Answer 10 · 2026-03-29 11:02:02

63

Views

First-order formula in first-order language, another open language where equivalence true on the naturals?

Published on 29 Mar 2026 - 11:02

score 961 · Answer 11 · 2026-03-26 06:31:04

961

Views

How to find a subgraph of cliques with the minimum total sum weight

Published on 26 Mar 2026 - 6:31

score 122 · Answer 12 · 2026-03-25 23:37:42

122

Views

Run Time Analysis of the Merging Part in Mergesort

Published on 25 Mar 2026 - 23:37

score 1.4k · Answer 13 · 2017-01-09 21:32:58

1.4k

Views

Finding the sequence with the smallest sum in array

Published on 09 Jan 2017 - 21:32

score 9.5k · Answer 14 · 2017-01-10 07:21:13

9.5k

Views

What is the difference between non-reflexive or irreflexive?

Published on 10 Jan 2017 - 7:21

score 281 · Answer 15 · 2026-04-01 14:22:03

281

Views

How to show that this algorithm needs $\Omega(n \log n)$ comparisons

Published on 01 Apr 2026 - 14:22

List Question

Claim about Turing machines

A Combinatorial Problem on Families of Subsets of $[n]$

Finding regular language and DFA for equation $(2)$

Counting the total number of possible passwords

Prove that if $\quad\max\{\text{size(t.left),size(t.right)\}}\leqslant 2/3\text{ size(t)}\}$ than the height of T is $O(\log n)$

Minimum number of triangles in triangulation of points in general position

permutation and combinations discrete mathematics

Unlimited register machine "bounded-accepts", recursively enumerable.

Two recursively enumerable sets $A$ and $B$ such that none of union, intersection, one subtracting the other is recursive?

First-order formula in first-order language, another open language where equivalence true on the naturals?

How to find a subgraph of cliques with the minimum total sum weight

Run Time Analysis of the Merging Part in Mergesort

Finding the sequence with the smallest sum in array

What is the difference between non-reflexive or irreflexive?

How to show that this algorithm needs $\Omega(n \log n)$ comparisons

Trending Questions

Popular # Hahtags

Popular Questions