Theoretical Computer Science
R B
  • Member for 7 years, 9 months
Profile Activity
Stats
9,214
reputation
107k
reached
67
answers
86
questions
Communities
View all
About

Can be reached at db6b15f90f3[at]gmail.com

.

Badges
View all badges
5
gold badges
31
silver badges
69
bronze badges
Top tags
View all tags
116
Score
33
Posts
22
Posts %
90
Score
38
Posts
25
Posts %
60
Score
28
Posts
18
Posts %
59
Score
67
Posts
44
Posts %
40
Score
13
Posts
8
Posts %
26
Score
14
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
54
Most memorable CS paper titles
Oct 22 '14
25
Deciding emptiness of intersection of regular languages in subquadratic time
Jan 14 '15
22
Is NP in $DTIME(n^{poly\log n})$?
Mar 16 '14
18
Bounds on the size of the smallest NFA for L_k-distinct
Jan 6 '14
17
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
Jan 12 '14
16
Graph problems which are NP-Complete on directed graphs but polynomial on undirected graphs
Feb 11 '14
16
Can constant ambiguity reduce the state complexity of a regular languages?
Jun 2 '14
16
Hardest known natural problem in P?
Apr 7 '14
14
Which properties of planar graphs generalize to higher dimension / hypergraphs?
Mar 23 '14
14
Does PSPACE-completeness imply approximation hardness?
Mar 29 '14
Top Meta posts
3
0
10
Why are comments not editable after more than 5 minutes?
Top network posts
View all network posts
23
Is every factorial divisible by its sum of digits?
21
Problems that provably require quadratic time
19
Complexity of finding binomial coefficient which equals to a number
16
Lost in a "one directional" concert
15
Submodularity property in congestion games?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.