These words have
again been proven true by Galgotias scholar Naveen Kumar Goswami ,
student of final year CSE. He has developed one of the most efficient
solution for the problem which is still unrevealed since last 40 years in field of computational complexity. His work has been widely appreciated internationally.The Endeavour and zeal to fulfill the desire and dreams of student has always been a slogan of Galgotia. The highly technical environment and proficient labs make it easier for students to mould themselves for Innovations and Analyses. The highly consecrated faculty provided with the itnary to view each expect of the problem liberally panoptically. These prodigious facilities made it quite comfortable and motivated him, To present and Publish his research work at the “International Science Conference ISSC 2012, Russian federation.
Not only did Galgotias provided monetary and Financial help but also helped him out regarding Nitty-gritty’s of the research work so as to maintain the required standard and given him a chance to develop the most efficient and affective Polynomial time algorithm that has ever been developed in history of computer science and mathematical discipline for the “Minimum vertex cover problem”.
Sir, first of all i would like to thank you personally for, you have provided me full support because of that today my work has been recognized at international level. i was glad to got to know that at International conference ISSC, Russia, i was the only one there who was chosen to present and publish research work from whole Southeast Asian region, it itself is proud feeling for me to be a part of Galgotias.
