Loading…
On the operations of bounded suffix summation and multiplication
The operations of bounded suffix summation and bounded suffix multiplication are introduced. Using these operations, we define the class BSSM of polynomially computable functions. It is proved that the class BSSMcontains the class BPC defined by the operation of bounded prefix concatenation and has...
Saved in:
Published in: | Journal of applied and industrial mathematics 2017-10, Vol.11 (4), p.545-553 |
---|---|
Main Author: | |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The operations of bounded suffix summation and bounded suffix multiplication are introduced. Using these operations, we define the class BSSM of polynomially computable functions. It is proved that the class BSSMcontains the class BPC defined by the operation of bounded prefix concatenation and has finite basis under superposition. |
---|---|
ISSN: | 1990-4789 1990-4797 |
DOI: | 10.1134/S1990478917040123 |