Theoretical Computer Science
Profile Activity
Meta user
Network profile
9,194
reputation
5
31
69

R B

Can be reached at db6b15f90f3[at]gmail.com

.

67
answers
86
questions
~103k
people reached
  • Member for 7 years, 4 months
  • 880 profile views
  • Last seen yesterday

Communities (13)

Top Meta Posts
3
0

Top network posts

Top tags (116)

Score 116
Posts 33
Posts % 22
Score 90
Posts 38
Score 60
Posts 28
Score 59
Posts 67
Score 40
Posts 13
Score 26
Posts 14
View all tags →

Top posts (153)

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
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 Which properties of planar graphs generalize to higher dimension / hypergraphs? Mar 23 '14
14 Does PSPACE-completeness imply approximation hardness? Mar 29 '14
View all questions and answers →

Badges (105)

Gold

5

Rarest

Silver

31

Rarest

Bronze

69

Rarest

View all badges →

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.