Ideas for new issues
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.