It explains why certain problems have no practical solutions and helps researchers anticipate the difficulties involved in solving problems of certain types. The classification is quantitative and investigates both the resources that are necessary to solve a problem called lower bounds for the problem and the resources currently known to be sufficient called upper bounds. In general, complexity theory deals with the quantitative laws of computation and reasoning. For this reason, complexity theory concerns issues and problems of direct interest to many other disciplines as well.
Design of algorithm studies methods and techniques used to develop efficient algorithms. The design of efficient algorithms is often a critical first step in solving problems in many areas. Depending on the model of computation or computer platform that is required for an application, one might draw on algorithmic research in specific subareas.
UB Distinguished Professor; Adjunct Professor of Electrical Engineering; Adjunct Professor of Structural Biology; Senior Research Scientist at the Hauptman-Woodward Medical Research Institute
Computer Science and Engineering
338F Davis Hall
Phone: (716) 645-4737
Computer scientists introduce innovative new work at annual conferences. The most prestigious conferences in this area are: