A priori estimation of problem solution time of FORTRAN programs

zbMATH Open0736.68015MaRDI QIDQ1183751FDOQ1183751

Authors: L. S. Danil'chenko, V. A. Lyudvichenko 

Publication date: 28 June 1992

Published in: Programming and Computer Software (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1574486
• scientific article; zbMATH DE number 3968395
• Waiting time estimates for programs in a computer with limited resources
• Polynomial estimation of the complexity of algorithms
• scientific article; zbMATH DE number 5885664

zbMATH Keywords

program characteristicscomputational and applied mathematicsproblem solution time

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Theory of software (68N99)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A priori estimation of problem solution time of FORTRAN programs

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