По вашему запросу найдено документов: 6637
Страница 4 из 664
Вычислительные задачи большой алгоритмической сложности и модулярная арифметика machine arithmetic.
I* 0-ModulesWe study rings over which every module is an I*0 -module dual to I 0-module. We describe
A mechanistic study of the association between symbolic approximate arithmetic performance and basic number magnitude processing based on task difficulty with children's arithmetic performance. However, it remains unclear whether these abilities are independent
Structurally orthogonal finite precision FPGA implementation of block-lifting-based quaternionic paraunitary filter banks for L2L image coding using distributed arithmetic (DA) as a block of M-band linear phase paraunitary filter banks (LP PUFB
Universal computable enumerations of finite classes of families of total functionsarithmetical enumeration
Minimal generalized computable enumerations and high degreesarithmetic enumeration
Rings over which every module is an I*0 -module© 2017, Allerton Press, Inc. We obtain a description of semi-artinian rings over which every module
Modules which are invariant under nilpotents of their envelopes and covers© 2020 World Scientific Publishing Co. Pte Ltd. All rights reserved. A module is called nilpotent
Modules close to the automorphism-invariant and coinvariant where some well-known results on essentially injective modules, automorphism-(co)invariant modules
Generalized SV-modulesGiven an arbitrary quasiprojective right R-module P, we prove that every module in the category σ
Страница 4 из 664
Фасеты
Партнеры
Индексация
