Ushbu ishga iqtibos qilgan ishlar

4 ta ish

Ish: Separable Algorithmic Representations of Classical Systems and their Applications

1. One Question of the Theory of Numbered Groups

   N. Kh. Kasymov

   MaqolaComputability, Logic, AI AlgorithmsSiberian Mathematical Journal20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.004198

2. Negativity of effectively separable numberings of fields the finite characteristic

   N. Kh. Kasymov, N. R. Karimova, E. A. Khodzhamuratova

   MaqolaComputability, Logic, AI AlgorithmsMathematics and Theoretical Computer Science20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.007548

3. Finite logical specifications of effectively separable data models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   MaqolaComputability, Logic, AI AlgorithmsIzvestiya Vysshikh Uchebnykh Zavedenii Matematika20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.008520

4. Finite Logical Specifications of Effectively Separable Data Models

   N. R. Karimova, N. Kh. Kasymov, S. K. Zhavliev

   MaqolaStatistical and Computational ModelingRussian Mathematics20250 iqtibos

   ABIABI:AkademIndex/openalex/2025.article.010841