scientific article; zbMATH DE number 1148334

MaRDI QIDQ4386802zbMATH OpenFDO

Authors G. Z. Sarkisyan

Publication date 27 June 1999

zbMATH Keywords

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

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• Some results on uniform arithmetic circuit complexity
• Elusive functions and lower bounds for arithmetic circuits
• Arithmetic circuits: a survey of recent results and open questions
• Computational possibilities of the apparatus of generating functions in discrete problems
• scientific article; zbMATH DE number 3904571
• Functions definable by arithmetic circuits
• scientific article; zbMATH DE number 3979140
• scientific article; zbMATH DE number 4179432
• On the problem of computational time and complexity of arithmetic functions
• scientific article; zbMATH DE number 3878908

Cited in

(2)

• scientific article; zbMATH DE number 3958737 (Why is no real title available?)
• scientific article; zbMATH DE number 844162 (Why is no real title available?)

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)