Skip to main content
Computer Science
Sarvottamananda's user avatar
Sarvottamananda's user avatar
Sarvottamananda's user avatar
Sarvottamananda
  • Member for 8 years, 7 months
  • Last seen more than 1 year ago
Profile Activity
Stats
4,837
reputation
204k
reached
124
answers
0
questions
Communities
View all
About

I am a monastic faculty of Computer Science at Ramakrishna Mission Vivekananda University, Howrah, West Bengal, India. I am interested in Computational Geometry as well as Computational Complexity.

--
A bird to another bird on rockets, "If your tail is on fire, you will fly as fast."

Badges
View all badges
1
gold badge
13
silver badges
19
bronze badges
Top tags
View all tags
88
Score
23
Posts
19
Posts %
83
Score
24
Posts
19
Posts %
52
Score
11
Posts
9
Posts %
47
Score
19
Posts
15
Posts %
47
Score
15
Posts
12
Posts %
32
Score
15
Posts
12
Posts %
Top posts
View all questions and answers
answer
16
Is there any uncountable Turing decidable language?
Feb 16, 2016
answer
13
Finding examples of languages that are "anti-palindromic"
Feb 11, 2016
answer
13
How long does the Collatz recursion run?
Mar 11, 2016
answer
12
How can I show that the Cook-Levin theorem does not relativize?
Feb 21, 2016
answer
11
Proving $A$ avoiding $B$ regular if $A$ and $B$ are regular
Feb 13, 2016
answer
10
Why is ZPP = RP ∩ co-RP?
Mar 22, 2016
answer
9
Why is simulation by non deterministic Turing machine faster than a deterministic one?
Feb 20, 2016
answer
8
How to show ExactOneSAT is NP-Complete?
Feb 14, 2016
answer
7
"Not in big theta but in big O"
Feb 21, 2016
answer
7
XOR two numbers
Feb 20, 2016