The complexity of the tabulation of trajectory problems

DOI10.1016/0041-5553(85)90169-7MaRDI QIDQ3738867zbMATH OpenOpenAlexFDO

Authors V. K. Leont'ev, Eh. N. Gordeev

Publication date 1985

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(85)90169-7

zbMATH Keywords

balls of stabilityminimum epsilon-coverspace of matrices with Chebyshev metric

Mathematics Subject Classification ID

Economic growth models (91B62)

Recommendations

• scientific article; zbMATH DE number 3934720
• scientific article; zbMATH DE number 2002586
• Polynomial time algorithms for tracking path problems
• Polynomial Time Algorithms for Tracking Path Problems
• Geodesic complexity of motion planning
• The problem of trajectories avoiding a sparse terminal set
• Topological complexity and efficiency of motion planning algorithms
• On the realizability of lengths in trajectory problems
• scientific article; zbMATH DE number 3871373
• Complexity of nonholonomic motion planning

Cited in

(3)

• Stability of a schedule minimizing mean flow time
• scientific article; zbMATH DE number 3871373 (Why is no real title available?)
• scientific article; zbMATH DE number 3934720 (Why is no real title available?)

This page was built for publication: The complexity of the tabulation of trajectory problems

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