Theoretical Computer Science

Theoretical Computer Science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

Theoretical Computer Science research area focuses on the study of time complexity of algorithms in such computational models as decision trees, decision rule systems and acyclic programs with applications (mainly theoretical) to combinatorial optimization, fault diagnosis, pattern recognition, machine learning, data mining and analysis of Bayesian networks.

Extensions of dynamic programming for sequential optimization relative to different cost functions and for study of relationships between two cost functions with applications to combinatorial optimization and data mining.