A Complexity Tradeoff in Ranking-Function Termination Proofs

Acta Informatica - Germany
doi 10.1007/s00236-008-0085-0
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy