User Zach Langley

17 votes

Accepted

What does it mean to say a language is context-free?

answered Apr 10, 2011 at 4:42

14 votes

Accepted

How to show that $ALL_{DFA}$ is in P

answered Mar 20, 2011 at 23:12

9 votes

Algorithmic Complexity of $i^2$

answered Sep 11, 2012 at 15:13

4 votes

Accepted

Defining the connectivity of a graph

answered Dec 7, 2018 at 19:28

3 votes

Accepted

algorithm to compute a linear extension of partial order

answered Dec 2, 2019 at 16:00

3 votes

Accepted

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

answered Dec 10, 2018 at 17:34

3 votes

Accepted

Words of length $n$ containing an odd number of zeros

answered Dec 13, 2018 at 23:07

3 votes

Accepted

Is a line considered a face in graph theory?

answered Feb 20, 2012 at 2:06

3 votes

Accepted

Given a graph $G$, how to find all disjoint edges?

answered Apr 6, 2011 at 11:23

3 votes

Accepted

What is the expected value of points earned in a dice game with 5 rolls?

answered Mar 10, 2020 at 1:17

2 votes

Accepted

Proving a bipartite graph is not planar

answered Dec 30, 2019 at 22:28

2 votes

What is a T-Join?

answered Dec 30, 2019 at 16:17

2 votes

Idempotence of absolute value: how to show $\big| |a| \big| = |a|$?

answered Dec 14, 2018 at 17:26

1 vote

Accepted

Disprove that $L_1^\cup L_2^ = (L_1\cup L_2)^*$.

answered Dec 2, 2019 at 16:52

1 vote

Accepted

Expectation in spectral sparsification algorithms

answered Dec 11, 2018 at 0:58

1 vote

Accepted

Getting primitive roots of 14

answered Nov 8, 2011 at 14:43

1 vote

Accepted

Finding the Augmenting Path

answered Nov 22, 2011 at 3:55

1 vote

How to solve this recurrence relation: $T(n) = 4\cdot T(\sqrt{n}) + n$

answered Nov 22, 2012 at 14:50

1 vote

Finding "holes" in planar graphs

answered Jul 28, 2018 at 0:32

1 vote

All-Pairs Shortest Path

answered Jan 4, 2020 at 19:57

1 vote

Accepted

In a bipartite graph with 2 matchings saturating a subset of both sides, find a matching that saturates both subsets

answered Mar 10, 2020 at 1:40

1 vote

Accepted

k-connected graphs Explanation

answered Dec 30, 2019 at 21:35

0 votes

Accepted

Pumping lemma usage

answered Nov 14, 2011 at 1:56

0 votes

Algorithm to find how many edges weighted x exist in every MST of graph

answered Dec 2, 2019 at 16:15

Stack Exchange Network

24 Answers

What does it mean to say a language is context-free?

How to show that $ALL_{DFA}$ is in P

Algorithmic Complexity of $i^2$

Defining the connectivity of a graph

algorithm to compute a linear extension of partial order

I am stuck on Fermat's Little Theorem. I know how to apply it, but does it apply here $15^{48}$ mod $53$.

Words of length $n$ containing an odd number of zeros

Is a line considered a face in graph theory?

Given a graph $G$, how to find all disjoint edges?

What is the expected value of points earned in a dice game with 5 rolls?

Proving a bipartite graph is not planar

What is a T-Join?

Idempotence of absolute value: how to show $\big| |a| \big| = |a|$?

Disprove that $L_1^\cup L_2^ = (L_1\cup L_2)^*$.

Expectation in spectral sparsification algorithms

Getting primitive roots of 14

Finding the Augmenting Path

How to solve this recurrence relation: $T(n) = 4\cdot T(\sqrt{n}) + n$

Finding "holes" in planar graphs

All-Pairs Shortest Path

In a bipartite graph with 2 matchings saturating a subset of both sides, find a matching that saturates both subsets

k-connected graphs Explanation

Pumping lemma usage

Algorithm to find how many edges weighted x exist in every MST of graph