Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Shreesh
RKMVU, Howrah, West Bengal, India
http://cs.rkmvu.ac.in/~shreesh/
top
accounts
reputation
activity
subscriptions
Top Questions
No questions with score of 5 or more
Top Answers
16
Is there any uncountable Turing decidable language?
cs.stackexchange.com
14
How long does the Collatz recursion run?
cs.stackexchange.com
13
Finding several examples of languages that are anti-palindromic
cs.stackexchange.com
12
How can I show that the Cook-Levin theorem does not relativize?
cs.stackexchange.com
11
Proving $A$ avoiding $B$ regular if $A$ and $B$ are regular
cs.stackexchange.com
10
Why is ZPP = RP ∩ co-RP?
cs.stackexchange.com
9
Why is simulation by non deterministic Turing machine faster than a deterministic one?
cs.stackexchange.com
8
How to show ExactOneSAT is NP-Complete?
cs.stackexchange.com
7
Is Post's correspondence problem recognizable?
cs.stackexchange.com
7
XOR two numbers
cs.stackexchange.com
7
"Not in big theta but in big O"
cs.stackexchange.com
7
What does it mean to be Turing reducible?
cs.stackexchange.com
6
Finding a way out of a polygon
cs.stackexchange.com
6
Non-regularity of the set of primes in unary encoding using Myhill-Nerode
cs.stackexchange.com
6
Can RadixSort be Ω(n log n)?
cs.stackexchange.com
6
Can any finite problem be in NP-Complete?
cs.stackexchange.com
5
Does this Algorithm (probably Fourier like) Exist for 2D Shapes?
scicomp.stackexchange.com
5
What is a stateful computation?
cs.stackexchange.com
5
When to not use count sort?
cs.stackexchange.com
5
Can I remove left recursion on this grammar
cs.stackexchange.com
5
Is the NP-hardness Proof with One Way Implication Correct and Why?
cs.stackexchange.com
5
Universal Multi Head Turing Machine
cs.stackexchange.com
5
Minimize a sum with a weight constraint
cs.stackexchange.com
5
How is $a^nb^nc^{2n}$ not a context free language, where as $a^nb^mc^{n+m}$ is?
cs.stackexchange.com
5
$s \to aSb|bSb|a|b$; what isthe language generated by the grammar over the set of alphabets {a,b}
cs.stackexchange.com
5
Is it possible that $\mathsf{L} = \mathsf{NP}$?
cs.stackexchange.com
Stack Exchange works best with JavaScript enabled