Сборник заданий по дискретной математике
The article describes the original software tools for an experimental estimation of computational complexity of software solutions for problems on graph models of systems. The classes of the solved problems and the tools for analysis of results are listed. The method based on selection of graph models by their structural complexity is introduced.
The Markov School is the school of mathematics (mostly mathematical logic) arisen in St.Petersburg in the 20th century. Historically, the Markov School has been largely connected with the Steklov Mathematical Institute in St. Petersburg. Today, many Markov School mathematicians have taken up positions in different countries; of course, we do not attempt to restrict this survey only to those who have stayed in St. Petersburg. However, all mathematicians whose work we describe studied in St. Petersburg and, at least for several years and often for decades, worked at the Steklov Mathematical Institute. In this paper, we primarily discuss what has happened over the last two decades, so a certain bias to computational complexity is to be expected.