Theoretical Computer Science
Joseph Stack
  • Member for 7 years, 9 months
Profile Activity
Stats
1,085
reputation
4k
reached
8
answers
8
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (10)

Top network posts

This user doesn’t have any gold badges yet.
6
silver badges
13
bronze badges
View all badges

Top tags (26)

Score 35
Posts 5
Posts % 31
Score 32
Posts 4
Score 17
Posts 2
Score 4
Posts 7
Score 3
Posts 3
Score 3
Posts 3
View all tags →

Top posts (16)

All Questions Answers
Votes Newest
14 How small can a NFA be, compared to the minimal Unambiguous Finite Automaton (UFA) of the same regular language? Jan 13 '14
12 Hardness of optimal sorting Feb 19 '14
10 Simple path on dag with backward edges Apr 16 '15
10 What is the state complexity of the copy language? Jul 23 '15
9 Computing weighted sums of binomial coefficients Jan 12 '14
8 Computing the most likely winner in elections : intermediate case between Kemeny and Borda? Aug 7 '14
8 The number of states of local automata Feb 5 '14
7 Lower bound for the maximal vectors problem Feb 5 '14
3 Maximum weight triangles in dense graphs May 9 '16
3 On equivalence of NLBA and DLBA Feb 10 '14
View all questions and answers →

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.