Tayzwi

Should be reading more and writing less, but well...

Monday, September 27, 2004

 

yes yase.....yes indeed....

If it weren't for your brother, it could've been you papanna......it could've been you. And you are a damn good writer. Wasted as a software engineer of course. And I am missing your scripts. People have changed, some of us in the US, some of us in India and !Bangalore (had to rub this bit of tech. notation), some of us are in different companies, some of us have seen relationships take different hues, and some of us, have done nothing.....maybe they have learnt some more Perl. But the point is, people have changed and that calls for a script. Do write one, please.

Richie, the whole idea behind this problem was to prove that the the blackbox algorithm is NP-Complete. And I was trying to prove that if you could solve the blackbox in polynomial time, you could solve the K-blackbox in polynomial time (my puzzle was to find this specific transformation), and the K-blackbox polynomial time eventually helps in solving Vertex Cover in polynomial time. And VC is known to be NP-complete. And so, the blackbox problem is NP-complete.

Comments: Post a Comment

<< Home

Archives

February 2004   July 2004   August 2004   September 2004   October 2004   November 2004   December 2004   January 2005   February 2005   March 2005   April 2005   May 2005   June 2005   July 2005   August 2005   September 2005   October 2005   November 2005   December 2005   January 2006   February 2006   March 2006   April 2006   May 2006   June 2006   July 2006   August 2006   September 2006   October 2006   November 2006   January 2007   April 2007   May 2007   June 2007   November 2007   December 2007   January 2008   March 2008   June 2008   February 2009   June 2009   February 2010   November 2010  

Quick index to blog-posts I like (from my personal website)

This page is powered by Blogger. Isn't yours? Statscounter is generating statistics of this page