“Helping”: several formalizations

DOI10.2307/2271779zbMATH Open0342.02025OpenAlexW1972026679MaRDI QIDQ4109657FDOQ4109657

Authors: Nancy Lynch 

Publication date: 1976

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2271779

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Title not available (Why is that?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Title not available (Why is that?)

Cited In (6)

• Characterization of realizable space complexities
• Robust algorithms: a different approach to oracles
• Relativization of the Theory of Computational Complexity
• On some natural complete operators
• The complexity types of computable sets
• Computational complexity of functions

This page was built for publication: “Helping”: several formalizations

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