XRDS Editors

We can have an issue dedicated to the computational and hardness aspects of algorithms, entitled ‘ Efficient Computation : Exploring the limits ‘. Various complexity and hardness aspects of algorithms can be highlighted in a brief manner and an article demystifying the P=NP problem may be contributed by a peer in Theoretical Computer Science, so that students may have a basic understanding of this Clay Millenium Problem. Moreover, articles related to primality testing, Travelling Salesman problem(TSP),Knapsack problem, Clique problem etc. may be added and an exact overview of P and NP hard problems can be presented.

Hi all of you,
I am Arka Bhattacharya from India and have been selected as the new event editor ( journals and conference) of XRDS. I will surely try to make significant contributions to the magazine and make it more accessible to students. Have a look at my website, sites.google.com/site/arkabhatt1990 to have a better understanding of me. I am an undergraduate student and my research interests include algorithms, complexity theory, game theory, number theory and other aspects of Theoretical Computer Science.