Skip to main content
vzn's user avatar
vzn's user avatar
vzn's user avatar
vzn
  • Member for 12 years, 5 months
  • Last seen more than 3 years ago
28 votes

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

22 votes

Implications of proof of abc conjecture for cs theory

17 votes
Accepted

Why are perfect graphs called perfect?

15 votes

Beautiful results in TCS

13 votes

Hardest known natural problem in P?

13 votes

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

11 votes

What CS blogs should everyone read?

11 votes

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

11 votes

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

11 votes

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

10 votes

Beautiful results in TCS

10 votes

Beautiful results in TCS

10 votes

Core algorithms deployed

9 votes

Core algorithms deployed

9 votes

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

9 votes

Applications of representation theory of the symmetric group

9 votes
Accepted

Speedup from algorithmic advances vs. hardware

8 votes

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

8 votes
Accepted

Chaos and the $P{=}NP$ question

8 votes

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

7 votes

What are natural examples of non-relativizable proofs?

7 votes

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

7 votes

Counterintuitive results for undergraduates

7 votes

Separating Logspace from Polynomial time

7 votes

The state of art for sunflower system

7 votes

Approaches to GI inspired by knot problem

7 votes

How to Create Mission Critical Software?

7 votes

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

7 votes

Shortest Equivalent CNF Formula

7 votes

Alan Turing's Contributions to Computer Science

1
2 3 4 5
10