Abstract algebraic structure of analytic theory of algorithms

zbMATH Open0583.68009MaRDI QIDQ1069295FDOQ1069295

N. A. Krinitskij

Publication date: 1984

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

iterative systemsabstract algorithmsabstract data structurequasialgorithms

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Abstract and axiomatic computability and recursion theory (03D75)

Cited In (7)

• Algebras with approximation and recursive data structures
• Algorithmic Meta-theorems
• Towards an Axiomatization of Simple Analog Algorithms
• Special Issue on Analysis of Algorithms
• Title not available (Why is that?)
• On the complexity of the differential-algebraic description of analytic complexity classes
• Title not available (Why is that?)

   Recommendations

• Algebraic algorithmics: Theory and applications 👍 👎
• 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?) 👍 👎
• Algorithmic aspects of arithmetical structures 👍 👎
• Algebraic complexity theory. I: An introduction 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithmic reducibilities of algebraic structures 👍 👎

This page was built for publication: Abstract algebraic structure of analytic theory of algorithms

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