On the complexity of some problems concerning the use of procedures. II
From MaRDI portal
Publication:1169277
DOI10.1007/BF00289578zbMath0494.68008OpenAlexW4232260294MaRDI QIDQ1169277
Publication date: 1983
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289578
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01)
Related Items
A polynomial determination of the most-recent property in Pascal-like programs, Complete problems for space bounded subclasses of NP
Cites Work