Computer Science
Haskell Fun
  • Member for 4 years, 4 months
  • Last seen more than 4 years ago
Profile Activity
Stats
369
reputation
10k
reached
2
answers
21
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
9
bronze badges
Top tags
View all tags
1
Score
23
Posts
100
Posts %
1
Score
4
Posts
17
Posts %
0
Score
7
Posts
30
Posts %
0
Score
4
Posts
17
Posts %
0
Score
3
Posts
13
Posts %
0
Score
3
Posts
13
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
4
Show that if $NP\subseteq BPP$ then also $NP=RP$ - considerations about solution
Aug 27 '17
3
Why we can't use non-deterministic turing machines in this case?
Aug 3 '17
2
Prove that $L$ is closed under Kleene star iff $L=NL$
Aug 16 '17
2
Prove that checking if context free grammar generates word with all symbols is NP-complete - unclear statement about encoing probem in exercise
Aug 11 '17
1
Solving $UCYCLE$ in logspace - two possible approaches ? Why can't we one of them use to solve connectivity?
Aug 9 '17
1
A problem is NP-hard iff its complement is coNP-complete
Aug 27 '17
1
Show that boring boolean circuit belongs to NP-complete class
Aug 26 '17
1
Show that (2,3)-satisfability is np-complete
Jul 27 '17
1
Find $i$-th number in unsorted sequence in logspace (deterministic turing machine)
Jul 31 '17
1
Confusing method of proving PSPACE-completness
Jul 25 '17
Top network posts
View all network posts
5
Can't use fontspec with pdflatex

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.