По вашему запросу найдено документов: 2996
Страница 3 из 300
Isolation from Side in 2-Computably Enumerable Degrees structures, in particular, in the 2-computably enumerable wtt-degrees and in low Turing degrees. Intuitively
Strong noncuppability in low computably enumerable degreesWe prove the existence of noncomputable low computably enumerable degrees b < a such that b
Enumeration degrees and enumerability of familesWe study the enumerability of families relative to the enumeration degrees. It is shown that if a
Computable Embeddings of Classes of Structures Under Enumeration and Turing Operators characterizations of the Turing and enumeration computable embeddings of classes of structures.
On the doubly connected domination polynomial of a graph© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set
Almost computably enumerable families of setsAn almost computably enumerable family that is not Ø′- computably enumerable is constructed
On computably enumerable structuresOn computably enumerable structures
Embeddings of *-graphs into 2-surfacesThis paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Страница 3 из 300
Фасеты
Партнеры
Индексация
