Foundations of computer science: combinatory algorithms and discrete structures

Abstract

The research proposed in this project is focused on the development of efficient combinatory algorithms and the investigation of discrete structures of interest, with the global aim of supporting in a fundamental manner the Science of computing. The focus of this project is classic in nature. Of the many fronts of computer Science which seek to give support to computationally intense research projects in contemporary Science, this project is classified on the mathematical front, addressing algorithmic problems in a rigorous manner. The algorithms developed are analyzed from the point of view of correction, performance and complexity, through a theoretical analysis and, when appropriate, complemented by implementations. The principal sub-themes to be tackled are as follows: 1) diverse methods for the development of algorithms for problems of combinatory optimization; 2) combinatory problems in computational biology; 3) structural aspects of graphs and correlated objects; 4) assyntotic properties and combinatory structures.(AU)