Theoretical Computer Science
Profile Activity
Meta user
Network profile
9,095
reputation
5
30
66

R B

Can be reached at db6b15f90f3[at]gmail.com

.

67
answers
84
questions
~93k
people reached
  • Member for 6 years, 3 months
  • 833 profile views
  • Last seen 1 hour ago

Communities (13)

Top Meta Posts
3
0

Top network posts

Top tags (115)

Score 116
Posts 33
Posts % 22
Score 89
Posts 38
Score 59
Posts 28
Score 58
Posts 65
Score 40
Posts 13
Score 26
Posts 14
View all tags →

Top posts (151)

All Questions Answers
Votes Newest
50 Most memorable CS paper titles Oct 22 '14
25 Deciding emptiness of intersection of regular languages in subquadratic time Jan 14 '15
23 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
16 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 Does PSPACE-completeness imply approximation hardness? Mar 29 '14
14 Does XOR automata (NXA) for finite languages benefit from cycles? Oct 2 '14
View all questions and answers →

Badges (101)

Gold

5

Rarest

Silver

30

Rarest

Bronze

66

Rarest

View all badges →