Latest Quantum complexity theory Stories

2012-05-10 09:27:42

Harvard's Robert Wood and MIT's Scott Aaronson win NSF's most prestigious award, which will help fuel their research pursuits Researchers Scott Aaronson of the Massachusetts Institute of Technology (MIT) and Robert Wood of Harvard University were recognized as Alan T. Waterman Awardees at a ceremony at the U.S. Department of State last week. While in the Washington, D.C. area, Aaronson and Wood also visited NSF headquarters, where they discussed their research in talks at the National...

2010-08-12 05:30:00

Scientists are challenging claims by a California mathematician that he has solved the long-standing "P vs. NP" problem, one of the most difficult unsolved riddles of computer science. Dr. Vinay Deolalikar of Hewlett-Packard laboratories says he has solved the long-standing question, one of seven Millennium Prize Problems set out by the Clay Mathematics Institute. The Institute has offered a $1 Million award for anyone who solves any of the problems, which they described as the most difficult...

Word of the Day
  • Scandinavian punch made of claret and aquavit with spices and raisins and orange peel and sugar.
This word comes from the Swedish 'glogg,' which is an alteration of 'glodgat,' mulled (wine).