Assistant Professor Benjamin Rossman will receive USD $60,000 over a two-year period to stimulate fundamental research.
Rossman, who has joint appointment in the Departments of Mathematics and Computer Science, specializes in showing that certain computational problems are inherently “hard” to solve. An application of the importance of finding “hard” problems is in cryptography — we want our encrypted information to be beyond the ability of computers to easily crack.
This line of research involves reasoning about mathematical models of computation such as Boolean circuits. Rossman’s main tool is a blackboard, as he works on theorems and major unsolved problems like P = NP?
“The University of Toronto has a great tradition in computational complexity theory,” Rossman said. “U of T University Professor Stephen Cook is one of the founders of the field and a major figure in the P = NP? question. Over the years, many wonderful people and ground-breaking results have come out of U of T. I am honoured to be part of the great Theory Group here.”
Read more about the Sloan Research Fellowships