scientific article; zbMATH DE number 3609124

zbMATH Open0392.68030MaRDI QIDQ4174232FDOQ4174232

Authors: B. A. Trakhtenbrot 

Publication date: 1977

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

zbMATH Keywords

Computational ComplexityApproximative AlgorithmComputable FunctionComputable PredicateFrequency AlgorithmFrequency ComputationsProbabilistic Algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Complexity of computation (including implicit computational complexity) (03D15) Algorithms in computer science (68W99)

Cited In (2)

• Computational complexity of functions
• Effective category and measure in abstract complexity theory

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