Complexity of Bradley-Manna-Sipma lexicographic ranking functions
From MaRDI portal
Publication:1702898
DOI10.1007/978-3-319-21668-3_18zbMath1381.68046arXiv1504.05018OpenAlexW2180082329MaRDI QIDQ1702898
Samir Genaim, Amir M. Ben-Amram
Publication date: 1 March 2018
Full work available at URL: https://arxiv.org/abs/1504.05018
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
This page was built for publication: Complexity of Bradley-Manna-Sipma lexicographic ranking functions
