On elementary word functions obtained by bounded prefix concatenation

DOI10.1515/DMA-2016-0013zbMathNoneOpenAlexW2486895637MaRDI QIDQ314213

Sergey S. Marchenkov

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0013

zbMATH Keywords

bounded prefix concatenationpolynomially computable function

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

Operation of bound prefix concatenation and finite superposition bases ⋮ On the coincidence of complexity classes BPC and \(\text{TC}^0 \) ⋮ On the operations of bounded suffix summation and multiplication ⋮ Bounded prefix concatenation operation and finite bases with respect to the superposition

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On elementary word functions obtained by bounded prefix concatenation