Potpourri

I stumbled upon a nice survey. Its a very well prepared test. They call it a political compass . The site itself is really interesting. And seems like a lot of study has been put in to come up with this test. Here are my test results. Give the test and find out whether your political beliefs reflect in the test results.

This image was taken from here .

Oh no, this isn't about another complexity class. (However, this name sounds cool for a complexity class doesn't it?) So this is a movie review for Taare Zameen Par. The movie tells a story of a dyslexic kid, Ishan . Insensitivity, either intended or unintended, towards him turns him into an unyielding and introvert kid. Parents lose patience and put him in a boarding school away from them. Ishaan finds it extremely difficult to stay away from his mother to whom he is very attached and also has another set of problems adjusting and coping with the studies at the boarding school. This causes a huge set back for Ishaan . On the verge of complete collapse, a new art teacher enters in his life. He not only detects dyslexia in Ishan but also is able to relate to him. He gains the kid's confidence and in a while they start communicating. Ishaan's communications with the teacher turn out to be extremely enhancing and rich. They help Ishaan to cope and fight his problems ...

A small note on progress made to improve the Karp-Lipton Theorem The original Karp-Lipton theorem says that If NP is contained in P/poly or if NP has polynomial sized circuits then polynomial hierarchy collapses to its second level. This was further improved upon by Kobler and Watanabe. They showed that polynomial hierarchy collapses down to ZPP^NP. The class S2P was defined by Canetti and studied by Russell and Sundaram. Russell and Sundaram observed that S2P contains P^NP and MA. It is very easy to observe that S2P is contained in Sigma2P and Pi2P . Cai proved a fundamental containment result that S2P is contained in ZPP^NP . (i.e. there is a zero error poly time oracle machine asking queries to a SAT oracle that can accept S2P.) Samik Sengupta observed that if NP is contained in P/poly then polynomial hierarchy collapses to S2P. There by, a nice improvement over Karp-Lipton arose from the class S2P. Before this result came, Arvind and Kobler proved that if NP has polysized circuit...