Network profile

galah92

Reputation

297

Top tag

complexity-theory

Next privilege

300 Rep.

Create new tags

Badges

Newest

Next badge

0/1

Impact

0 posts edited

0 helpful flags

12 votes cast

14 Questions

Votes Activity Newest Views

votes

answer

145

views

Non-existence of PSPACE-hard unary language

complexity-theory space-complexity

Apr 4 '19 at 11:02 David Richerby 77.2k

votes

answer

159

views

Between every two MST's there's a series of “nearby” MST's

graphs minimum-spanning-tree

Feb 15 '18 at 21:35 Willard Zhan 1,163

votes

answer

195

views

Vertex Cover of size at most $\log n$

complexity-theory vertex-cover

Jun 8 at 10:07 Oren Milman 103

votes

answer

views

Proving $L = \{ w : w \neq w^R \}$ over $\Sigma = \{0,1\}$ is CFL

formal-languages context-free formal-grammars

Feb 9 '18 at 11:12 Raphael♦ 67.4k

vote

answer

views

$NL^2 = NDSPACE(\log^2n)$ is closed under complement

complexity-theory space-complexity

Jun 20 at 13:13 Yuval Filmus 220k

vote

answer

views

Derandomize MAX-CUT problem using $\log n$ bits

randomness max-cut

Jun 18 at 11:44 Yuval Filmus 220k

vote

answer

views

Prove $EXP \subset E^E$

complexity-theory time-complexity

Aug 1 '18 at 13:11 Yuval Filmus 220k

vote

answers

views

STCON in L using matrix multipication algorithm?

space-complexity

Jul 12 '18 at 13:13 David Richerby 77.2k

vote

answers

504

views

Constructing a turing machine from a PDA - dealing with non-determinism

turing-machines pushdown-automata simulation

Dec 19 '17 at 10:23 Raphael♦ 67.4k

vote

answer

views

How to find the equivalence classes of a regular language

regular-languages

Nov 25 '17 at 14:45 Yuval Filmus 220k

votes

answers

views

Dominating Set Gap Problem Reduction

reductions vertex-cover

Jun 7 at 5:30 galah92 297

votes

answers

views

Proving $BPP[\frac{1}{3},\frac{2}{3}] = BPP[a,a+\gamma]$ where $0<a<a+\gamma<1$

complexity-theory randomness

May 21 at 14:35 galah92 297

votes

answer

100

views

Space complexity for connectivity problem with given graph diameter

graphs space-complexity

Mar 22 '18 at 11:11 quicksort 3,972

-1

votes

answer

519

views

Binary search trees: multiple `Successor()` calls

time-complexity binary-search-trees

May 14 '17 at 17:09 Yuval Filmus 220k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

14 Questions

Non-existence of PSPACE-hard unary language

Between every two MST's there's a series of “nearby” MST's

Vertex Cover of size at most $\log n$

Proving $L = \{ w : w \neq w^R \}$ over $\Sigma = \{0,1\}$ is CFL

$NL^2 = NDSPACE(\log^2n)$ is closed under complement

Derandomize MAX-CUT problem using $\log n$ bits

Prove $EXP \subset E^E$

STCON in L using matrix multipication algorithm?

Constructing a turing machine from a PDA - dealing with non-determinism

How to find the equivalence classes of a regular language

Dominating Set Gap Problem Reduction

Proving $BPP[\frac{1}{3},\frac{2}{3}] = BPP[a,a+\gamma]$ where $0<a<a+\gamma<1$

Space complexity for connectivity problem with given graph diameter

Binary search trees: multiple `Successor()` calls