Tat'yana Matveevna Kosovskaya

Available identifiers

Publication	Date of Publication	Type
Polynomial equivalence of the problems ``predicate formulas isomorphism and graph isomorphism	2019-12-19	Paper
NP-completeness conditions for consistency verification of some types of systems of linear Diophantine dis-equations	2018-04-05	Paper
NP-complete problems for systems of linear polynomial's values divisibilities	2017-09-20	Paper
NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine discongruences	2017-09-20	Paper
NP completeness conditions for verifying the consistency of several kinds of systems of linear Diophantine congruences and equations	2017-09-20	Paper
Mutual upper bounds of size and time for a Turing machine and a Markov-Post algorithm for mutual simulations	2017-09-19	Paper
https://portal.mardi4nfdi.de/entity/Q3589273	2010-09-20	Paper
The number of steps for construction of a Boolean solution to polynomial congruences and systems of polynomial congruences	2008-09-22	Paper
Estimating the number of steps that it takes to solve some problems of pattern recognition which admit logical description	2008-09-22	Paper
Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas	2008-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q3691089	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3719857	1985-01-01	Paper

This page was built for person: Tat'yana Matveevna Kosovskaya