2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
R B
  • Member for 8 years, 4 months
  • Last seen more than a week ago
Profile Activity
Stats
9,358
reputation
111k
reached
67
answers
87
questions
Communities
View all
About

Can be reached at db6b15f90f3[at]gmail.com

.

Badges
View all badges
5
gold badges
32
silver badges
72
bronze badges
Top tags
View all tags
116
Score
33
Posts
21
Posts %
91
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
Score Newest
question
55
Most memorable CS paper titles
Oct 22, 2014
question
25
Deciding emptiness of intersection of regular languages in subquadratic time
Jan 14, 2015
answer
22
Is NP in $DTIME(n^{poly\log n})$?
Mar 16, 2014
question
18
Bounds on the size of the smallest NFA for L_k-distinct
Jan 6, 2014
question
17
How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language?
Jan 12, 2014
question
17
Graph problems which are NP-Complete on directed graphs but polynomial on undirected graphs
Feb 11, 2014
question
16
Can constant ambiguity reduce the state complexity of a regular languages?
Jun 2, 2014
question
16
Can we approximate the number of words accepted by an NFA?
Aug 27, 2014
answer
16
Hardest known natural problem in P?
Apr 7, 2014
question
14
Does XOR automata (NXA) for finite languages benefit from cycles?
Oct 2, 2014
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.