Polynomial loops: beyond termination

DOI10.29007/NXV1MaRDI QIDQ7024202zbMATH OpenFDO

Authors Marcel Hark, Florian Frohn, Jürgen Giesl

Publication date 20 February 2025

zbMATH Keywords

decidabilityruntime complexityterminationhalting problem

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

This page was built for publication: Polynomial loops: beyond termination

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