scientific article; zbMATH DE number 1148334

zbMATH Open0920.03050MaRDI QIDQ4386802

G. Z. Sarkisyan

Publication date: 27 June 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

computability of arithmetic functionslogical networks with loopspolynomial Turing computationsrealization of restricted recursion

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Arithmetic Circuits: A survey of recent results and open questions 👍 👎
• Functions Definable by Arithmetic Circuits 👍 👎
• Computational possibilities of the apparatus of generating functions in discrete problems 👍 👎
• Some results on uniform arithmetic circuit complexity 👍 👎
• On the problem of computational time and complexity of arithmetic functions 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication:

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