Computer Science
Logic
  • Member for 4 years, 3 months
Profile Activity
Stats
309
reputation
5k
reached
2
answers
14
questions
About
Apparently, this user prefers to keep an air of mystery about them.

Communities (7)

Top network posts

We respect a laser-like focus on one topic.

This user doesn’t have any gold badges yet.
1
silver badge
9
bronze badges

Top tags (15)

Score 1
Posts 2
Posts % 12
Score 0
Posts 12
Score 0
Posts 3
Score 0
Posts 2
Score 0
Posts 1
Score 0
Posts 1
View all tags →

Top posts (16)

All Questions Answers
Votes Newest
5 Equivalance of NFAs, understanding the solution Aug 17 '17
3 Understanding of SPACE in non deterministic Turing Machines Jun 12 '17
2 Proving $P=BPP$ under a assumption Aug 25 '17
2 Composition of polynomial and logaritmic function Aug 21 '17
1 Complexity of multiplying matrix Jun 25 '17
1 Composing $L$ and $NL$ Aug 28 '17
1 If A is NL-complete then complement of A is also NL-complete? Aug 23 '17
1 Proving $P=BPP$ under a assumption Aug 26 '17
0 Reduction PSPACE language to DSPACE(O(1)) Aug 27 '17
0 Does a given Turing machine works in time limited by $5n$? Aug 26 '17
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.