Algorithmic complexity of linear nonassociative algebra
One of the central problems of algebraic complexity theory is the complexity of multiplication in algebras. For this, first, the concept of algebra is defined and the class of algebras under study is fixed. Then the concept of the algorithm and its complexity are clarified. in the most general sens...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Al-Farabi Kazakh National University
2020-09-01
|
| Series: | Вестник КазНУ. Серия математика, механика, информатика |
| Subjects: | |
| Online Access: | https://bm.kaznu.kz/index.php/kaznu/article/view/780/580 |