scientific article; zbMATH DE number 3934393

MaRDI QIDQ3706487zbMATH OpenFDO

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

Publication date 1982

zbMATH Keywords

computable analysisconstructive semanticsmeasures of informationrandom sequencessurveyunsolvability of mass problems

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Recommendations

• scientific article; zbMATH DE number 3077776
• scientific article; zbMATH DE number 3092551
• scientific article; zbMATH DE number 3966050
• scientific article; zbMATH DE number 193197
• scientific article; zbMATH DE number 3197110
• scientific article; zbMATH DE number 108379
• scientific article; zbMATH DE number 4028893
• Introduction to algorithm theory

Cited in

(6)

• Algorithms and algorithmic problems
• Structures computable in polynomial time. II
• Algorithmic search in group theory
• Existence and uniqueness of structures computable in polynomial time
• scientific article; zbMATH DE number 4028893 (Why is no real title available?)
• scientific article; zbMATH DE number 1301806 (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 Q3706487)