Материалов:
1 005 012

Репозиториев:
30

Авторов:
596 024

По вашему запросу найдено документов: 67082

Страница 1 из 6709

Polynomial-time presentations of algebraic number fields
field ℝalgof algebraic reals and of the field ℂalgof algebraic complex numbers are polynomial

УПОРЯДОЧЕННАЯ ФУНКЦИЯ В КОМПЛЕКСНОМ ПРОСТРАНСТВЕIn this article we provide a definition of complex-valued ordered functions with examples

Approaches to the implementation of generalized complex numbers in the Julia language-Klein models in theoretical calculations, the generalized complex numbers are essential. In the case

Fields of Algebraic Numbers Computable in Polynomial Time. I of complex algebraic numbers has an isomorphic presentation computable in polynomial time. A similar fact

Elementary theories and hereditary undecidability for semilattices of numberings
the theory of numberings. We use the following approach: given a level of complexity, say Σα0, we consider

Infinite order systems of differential equations and large scale random neural networks number of cells. The Cauchy problem for singular perturbed infinite order systems of stochastic

Polynomial Computability of Fields of Algebraic Numbers© 2018, Pleiades Publishing, Ltd. We prove that the field of complex algebraic numbers

NUMERICAL ANALYSIS OF A LARGE-SCALE HOPFIELD NEURAL NETWORK WITH SMALL PARAMETERS number of cells is considered. The Cauchy problem for singular perturbed systems of infinite order

Modelling a Crawler Robot Using Wheels as Pseudo-Tracks: Model Complexity vs Performance simulation performance. The model complexity is reflected by a number of virtual wheels that approximate each

Linear Orderings of Low Degree-quasi-discrete ordering of low degree has a computable representation, and study estimates for the complexity of all

Страница 1 из 6709