Polynomial equivalence of two models of computations in algebraic structures

MaRDI QIDQ7318094zbMATH OpenFDO

Authors N. R. Karatsev

Publication date 24 August 2026

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• Computational complexity in algebraic systems
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the P=NP problem in some rings
• Toward a generalized computability theory

This page was built for publication: Polynomial equivalence of two models of computations in algebraic structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318094)