scientific article; zbMATH DE number 4028893

MaRDI QIDQ3769959zbMATH OpenFDO

Authors A. L. Semenov, V. A. Uspenskiĭ

Publication date 1987

zbMATH Keywords

computational complexitytheory of algorithms

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory (03Dxx) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithms in computer science (68W99)

Cited in

(10)

• Mathematical metaphysics of randomness
• Markov's constructive analysis; a participant's view
• Recursive unary algebras and trees
• scientific article; zbMATH DE number 412149 (Why is no real title available?)
• A model of institutional control
• scientific article; zbMATH DE number 3934393 (Why is no real title available?)
• scientific article; zbMATH DE number 4022632 (Why is no real title available?)
• Recognition method of algorithms classes on the basis of asymptotics for the elasticity of complexity functions
• About some features of the transformed problems images
• Dynamical conflict models. I. Language of modeling

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 Q3769959)