Modern trends in discrete mathematics and computer science - История изменений

PodymovVV в 20:06, 7 октября 2024

2024-10-07T20:06:19Z

2024-10-07T20:04:35Z

2019-02-21T13:58:33Z

‎Lectures 3,4. Constraint satisfaction problem: the algebraic approach.

2019-02-07T13:55:49Z

‎Lectures 3,4. Constraint satisfaction problem: an algebraic approach.

2019-02-07T13:02:00Z

‎Lectures 3,4. Constraint satisfaction problem: an algebraic approach.

2019-02-07T10:59:15Z

‎Lectures 3,4. Constraint satisfaction problem: an algebraic approach.

2019-02-07T10:46:21Z

‎Lecture 8. 13С metabolic flux analysis.

2019-02-07T10:45:15Z

‎Lecture 7. Some new bounds of Shannon functions for cardinality of test sets for logical circuits.

2019-02-07T10:40:21Z

‎Lecture 5. Closed classes in k-valued and partial k-valued logics.

2018-04-12T17:12:58Z

‎Lecture 6. Algebras of minimal multiplicative complexity.

@@ Строка 1: / Строка 1: @@
 [[Категория:Спецкурсы кафедры МК (архив)]]
-[[Категория:Лекционные курсы кафедры МК]]
+[[Категория:Лекционные курсы кафедры МК (архив)]]
 Compulsory course for master students, 2-nd year, groups 618/1 and 618/2.

← Предыдущая		Версия 20:04, 7 октября 2024
Строка 1:		Строка 1:
−	[[Категория:Спецкурсы кафедры МК]]	+	[[Категория:Спецкурсы кафедры МК (архив)]]

	[[Категория:Лекционные курсы кафедры МК]]		[[Категория:Лекционные курсы кафедры МК]]

← Предыдущая		Версия 13:58, 21 февраля 2019
Строка 46:		Строка 46:

	Lecturer: [[Селезнева Светлана Николаевна \| Svetlana N. Selezneva]]		Lecturer: [[Селезнева Светлана Николаевна \| Svetlana N. Selezneva]]
−
−	~~[[Media: lect3-4-ex-selezn.pdf\|Exam]].~~

	== Lecture 5. '''Closed classes in k-valued and partial k-valued logics.''' ==		== Lecture 5. '''Closed classes in k-valued and partial k-valued logics.''' ==

@@ Строка 39: / Строка 39: @@
 Link to [3]: https://drive.google.com/open?id=1EAD7Ax9sU32E-9qZldmkrWRABQC1Awah
-== Lectures 3,4. '''Constraint satisfaction problem: an algebraic approach.''' ==
+== Lectures 3,4. '''Constraint satisfaction problem: the algebraic approach.''' ==
 [[Media: lect3-4-eng-selezn.pdf|Presentation]].
-The topic of the lecture is the constraint satisfaction problem (CSP).
+The topic of the lecture is the constraint satisfaction problem (for short, CSP). CSP is a universal formalization for a wide variety of problems in discrete mathematics and computer science. A characterization of the CSP complexity has recently been obtained by the algebraic approach. The aim of the lecture is to describe the algebraic approach to CSP and the results established by its applying.
 Lecturer: [[Селезнева Светлана Николаевна | Svetlana N. Selezneva]]

@@ Строка 43: / Строка 43: @@
 [[Media: lect3-4-eng-selezn.pdf|Presentation]].
-The topic of the lecture is the constraint satisfaction problem (CSP). CSP is the problem of checking whether a given system of relationships between elements of a certain set S is compatible. In the Russian-language literature, it is also called the problem of generalized feasibility. Numerous problems in computer science (in particular, in pattern recognition, program analysis, knowledge representation, databases) and discrete mathematics (for example, colorings of graphs) are naturally expressed in terms of CSP.
+The topic of the lecture is the constraint satisfaction problem (CSP).
-A promising approach to CSP is an algebraic one. Its idea is in considering functions that preserve all relations from the set S. Depending on the form of these functions, either polynomiality or NP-completeness of the corresponding problem can be shown. In this lecture CSP is formally specified and illustrated with numereous examples of its application. We also describe the algebraic approach to its solution and discuss the results (including the most recent ones) obtained with the help of this approach.
-−
 Lecturer: [[Селезнева Светлана Николаевна | Svetlana N. Selezneva]]

← Предыдущая		Версия 10:46, 7 февраля 2019
Строка 82:		Строка 82:

	== Lecture 8. '''13С metabolic flux analysis.''' ==		== Lecture 8. '''13С metabolic flux analysis.''' ==
		+
		+	Isotopic experiments with heavy carbon atoms (13C metabolic flux analysis) are a common method for analyzing the rates of metabolic reactions, the so-called “fluxes” (13C metabolic flux analysis). In the framework of the lecture, it is supposed to consider the main approaches to modeling the redistribution of heavy carbon atoms in the process of cell activity, as well as the main methods for solving the problem of determining metabolic fluxes.

	[[Media: paper-shupletsov-1.pdf\|Статья 1.]]		[[Media: paper-shupletsov-1.pdf\|Статья 1.]]

← Предыдущая		Версия 10:45, 7 февраля 2019
Строка 78:		Строка 78:

	== Lecture 7. '''Some new bounds of Shannon functions for cardinality of test sets for logical circuits.''' ==		== Lecture 7. '''Some new bounds of Shannon functions for cardinality of test sets for logical circuits.''' ==
		+
		+	This lecture gives an overview of the current state of art in the theory of control of logic circuits, which is connected with the study of the behavior of the Shannon functions of test lengths (that is, the lengths of minimal tests for the most difficult to test functions).

	== Lecture 8. '''13С metabolic flux analysis.''' ==		== Lecture 8. '''13С metabolic flux analysis.''' ==

@@ Строка 51: / Строка 51: @@
 == Lecture 5. '''Closed classes in k-valued and partial k-valued logics.''' ==
-This lecture gives a survey of results on the description of some parts of the lattice of closed classes in partial k-valued logics. The results on cardinality of the set of all closed classes in partial k-valued logic containing given precomplete class of k-valued logic are considered. Also results on cardinality of the set of all closed classes in partial 2-valued logic containing given closed class of 2-valued logic are considered.
+The lecture provides an overview of the results on the description of lattice fragments of closed classes (with respect to superposition) in k-valued and partial k-valued logics and describes the latest achievements in this field. Results will be presented on precomplete classes in k-valued and partial k-valued logics, on closed classes in partial k-valued logic, containing a given precomplete class of k-valued logic.
 Literature:

← Предыдущая		Версия 17:12, 12 апреля 2018
Строка 72:		Строка 72:

	Lecturer: '''Bekhan Chokaev'''.		Lecturer: '''Bekhan Chokaev'''.
		+
		+	[[Media: paper-chokaev-1.pdf\|Статья 1.]]
		+
		+	[[Media: paper-chokaev-2.pdf\|Статья 2.]]

	== Lecture 7. '''Some new bounds of Shannon functions for cardinality of test sets for logical circuits.''' ==		== Lecture 7. '''Some new bounds of Shannon functions for cardinality of test sets for logical circuits.''' ==