Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/18896
Title: Complexity of term representations of finitary functions
Authors: Ajhinger Erhard
Mudrinski Nebojša 
Opršal Jakub
Issue Date: 2018
Journal: International Journal of Algebra and Computation
Abstract: © 2018 World Scientific Publishing Company. The clone of term operations of an algebraic structure consists of all operations that can be expressed by a term in the language of the structure. We consider bounds for the length and the height of the terms expressing these functions, and we show that these bounds are often robust against the change of the basic operations of the structure.
URI: https://open.uns.ac.rs/handle/123456789/18896
ISSN: 0218-1967
1793-6500
DOI: 10.1142/S0218196718500480
Appears in Collections:PMF Publikacije/Publications

Show full item record

SCOPUSTM   
Citations

13
checked on May 10, 2024

Page view(s)

16
Last Week
3
Last month
0
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.