User vzn - Theoretical Computer Science Stack Exchange

vzn

Member for 11 years, 8 months
Last seen more than 2 years ago

vzn1.wordpress.com
U.S.

272 Answers

Score Activity Newest

28 votes

Probabilistic (randomized) algorithms before "modern" computer science appeared

answered Sep 11, 2012 at 20:33

22 votes

Implications of proof of abc conjecture for cs theory

answered Sep 11, 2012 at 5:15

17 votes

Accepted

Why are perfect graphs called perfect?

answered Nov 21, 2012 at 16:16

15 votes

Beautiful results in TCS

answered Feb 28, 2012 at 16:27

13 votes

Hardest known natural problem in P?

answered Feb 28, 2014 at 2:33

12 votes

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

answered Oct 13, 2014 at 3:40

11 votes

What CS blogs should everyone read?

answered Apr 21, 2014 at 15:37

11 votes

Better lower bounds than 3n for non-boolean functions?

answered Oct 20, 2015 at 15:22

11 votes

NTIME(n^k) ≠ DTIME(n^k) ?

answered Jan 9, 2012 at 19:32

11 votes

Probabilistic (randomized) algorithms before "modern" computer science appeared

answered Sep 11, 2012 at 20:59

10 votes

Beautiful results in TCS

answered Feb 27, 2012 at 19:34

10 votes

Beautiful results in TCS

answered Feb 27, 2012 at 19:45

10 votes

Core algorithms deployed

answered Nov 13, 2013 at 1:59

9 votes

Core algorithms deployed

answered Nov 14, 2013 at 2:19

9 votes

Statements that imply $\mathbf{P}\neq \mathbf{NP}$

answered Oct 10, 2014 at 18:42

8 votes

Does a noisy version of Conway's game of life support universal computation?

answered Jul 1, 2013 at 20:39

8 votes

Accepted

Speedup from algorithmic advances vs. hardware

answered Oct 11, 2012 at 18:30

8 votes

Are any of the state of the art Maximum Flow algorithms practical?

answered Feb 4, 2013 at 19:48

7 votes

The state of art for sunflower system

answered Dec 2, 2012 at 17:36

7 votes

Applications of representation theory of the symmetric group

answered Sep 24, 2012 at 18:52

7 votes

Approaches to GI inspired by knot problem

answered Oct 1, 2012 at 15:56

7 votes

How to Create Mission Critical Software?

answered Sep 12, 2012 at 15:27

7 votes

Are there any applications of techniques in real analysis to theoretical computer science?

answered Feb 9, 2012 at 2:34

7 votes

Shortest Equivalent CNF Formula

answered Jan 22, 2012 at 16:32

7 votes

Alan Turing's Contributions to Computer Science

answered Jun 24, 2012 at 14:41

7 votes

Are there non-constructive algorithm existence proofs?

answered Jul 30, 2012 at 22:16

7 votes

What are natural examples of non-relativizable proofs?

answered Jan 10, 2014 at 16:14

7 votes

Separating Logspace from Polynomial time

answered May 8, 2014 at 19:36

7 votes

Accepted

Chaos and the $P{=}NP$ question

answered Oct 30, 2015 at 15:47

7 votes

Are there any topics in theoretical CS that are more about pure math?

answered May 5, 2015 at 18:47

1

2 3 4 5

…