Exploitable results
The objective of the project was to update computer science facilities for the NIS participants and launch joint research based at the beginning on the current research activities of the participants with further concentration on particular topics of interest for computer science. Under the support of the project the participants solved some hard problems of graph theory related to flow algorithms, graph embeddings and expanders, developed new formalisms for analysis of programmes under complexity constraints, developed a formalism for interactive proof systems, developed effective algorithms for model checking and constructing optimal strategies for new classes of processes with uncertainty.
The received results are theoretical. The results of Karzanov (ISA) and Ustimenko (UK) give solutions to some known problems in graph theory that are closely related to constructing effective algorithms. The results of Beltiukov (UDSU) and his group contain further development of formalisms aimed at program synthesis and efficient query processing. E.Dantsin (POMI) has found a precise formalization of interactive proof systems which are intensively studied last years and can be applied to self-checking programs and fast verification of proof correctness. S.Baranoff (SPII) developed methods of automatic evaluation of software parameters and analysed approaches to practical testing of specific software. D. Beauquier (UP12) and A. Slissenko (UP12) found new efficient algorithms for model checking in temporal probabilistic logics. M. de Rougemont (UP11) and S.Ivanov (POMI) developed new interactive protocols for problems over reals.
Suche nach OpenAIRE-Daten ...
Bei der Suche nach OpenAIRE-Daten ist ein Fehler aufgetreten
Es liegen keine Ergebnisse vor