Computer Science
Network profile
149
reputation
1
8

Haskell Fun

Apparently, this user prefers to keep an air of mystery about them.

2
answers
21
questions
~5k
people reached
  • Member for 2 years, 2 months
  • 47 profile views
  • Last seen Dec 3 '17 at 12:07

Communities (9)

Top network posts

We respect a laser-like focus on one topic.

Top tags (18)

Score 1
Posts 23
Posts % 100
Score 1
Posts 4
Score 0
Posts 7
Score 0
Posts 4
Score 0
Posts 3
Score 0
Posts 3
View all tags →

Top posts (23) All Questions Answers | Votes Newest

3 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 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 Solving $UCYCLE$ in logspace - two possible approaches ? Why can't we one of them use to solve connectivity? Aug 9 '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
View all questions and answers →

Badges (9)

Gold

—

Silver

1

Rarest

Bronze

8

Rarest