Complexity of term representations of finitary functions

Erhard Aichinger, Nebojsa Mudrinski, Jakub Oprsal

Research output: Working paper and reportsPreprint

Abstract

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.
Original languageEnglish
Number of pages13
DOIs
Publication statusPublished - Sept 2017

Publication series

NamearXiv.org
No.arXiv:1709.01759
ISSN (Print)2331-8422

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101013 Mathematical logic
  • 102031 Theoretical computer science

JKU Focus areas

  • Computation in Informatics and Mathematics
  • Engineering and Natural Sciences (in general)

Cite this