По вашему запросу найдено документов: 2996
Страница 7 из 300
О центре графа, определяемого подгруппами Шмидта конечной группы-nilpotent group whose proper subgroups are nilpotent. Schmidt graph of a finite group G is
the prime graph
Nonlinear Schrödinger equations on periodic metric graphs potentials on periodic metric graphs. Assuming that the spectrum of linear part does not contain zero, we
Definable relations in Turing degree structuresIn this paper we investigate questions about the definability of classes of n-computably enumerable
On the Problem of Definability of the Computably Enumerable Degrees in the Difference Hierarchy© 2018, Pleiades Publishing, Ltd. Questions of definability of computably enumerable degrees
A semilattice generated by superlow computably enumerable degreesWe prove that a partially ordered set of all computably enumerable (c. e.) degrees
Graphs and algebras of symmetric functionsGraphs and algebras of symmetric functions
There is no low maximal d. c. e. degreeWe show that for any computably enumerable (c. e.) set A and any Δ0 2 set L, if L is low and L
Elementary theories and structural properties of d-c.e. and n-c.e. degrees and enumeration degrees of n-c.e. sets. Questions on the structural properties of these semilattices, and some
Genetic algorithm of network graph multi-objective optimization as an instrument of project monitoring graph that represents dependences between project tasks. Article describes the features and problems
Сравнительный анализ цифровых коллекций библиотечного фонда РФ и данных проекта EnumerateСравнительный анализ цифровых коллекций библиотечного фонда РФ и данных проекта Enumerate
Страница 7 из 300
Фасеты
Партнеры
Индексация
