Skip to main content
Surya Narayanaraju Bhupatiraju, 17, of Lexington, entered an Intel Science Talent Search project in mathematics that explored the computational complexity of the marginal satisfiability problem (MSP). An example of the MSP would be to determine whether, given summaries of data, it is possible to prove that the summaries correspond to actual data. Surya explored the MSP, identified several variations of the problem, and invented efficient algorithms for them. In particular, he developed an algorithm that permitted negative values, such as might occur with profits and losses, and a randomized algorithm that could be used to find approximately correct solutions to MSP problems. Surya's results may improve data compression techniques and summary tools used in data security. Surya attends Lexington High School, where he competes as part of the math and science bowl teams, as well as the Ultimate Frisbee team. He is also a member of the school's computer science league and volunteers as a tutor. The son of Venkata and Indira Bhupatiraju, he is fluent in his native language, Telugu, and has co-authored two published papers. His hobbies include running and breakdancing.
Learn about more Intel STS 2013 finalists.
Sign-up for the free SSP newsletter today.
PLEASE CONTACT US
1719 N Street, N.W. Washington, D.C. 20036202.785.2255
© 2013 Copyright
CONNECT WITH SSP