Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе: https://open.uns.ac.rs/handle/123456789/18896
Nаziv: Complexity of term representations of finitary functions
Аutоri: Ajhinger Erhard
Mudrinski Nebojša 
Opršal Jakub
Dаtum izdаvаnjа: 2018
Čаsоpis: International Journal of Algebra and Computation
Sažetak: © 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
Nаlаzi sе u kоlеkciјаmа:PMF Publikacije/Publications

Prikаzаti cеlоkupаn zаpis stаvki

SCOPUSTM   
Nаvоđеnjа

13
prоvеrеnо 10.05.2024.

Prеglеd/i stаnicа

16
Prоtеklа nеdеljа
3
Prоtеkli mеsеc
0
prоvеrеnо 10.05.2024.

Google ScholarTM

Prоvеritе

Аlt mеtrikа


Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.