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

Related search

Certification of Termination Proofs Using CeTA

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

A Structural Ranking of Economic Complexity

SSRN Electronic Journal
2019English

Errors in Computational Complexity Proofs for Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Note on the Complexity of Classical and Intuitionistic Proofs

2015English

Interpreting Hash Function Security Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Complexity in Automation of SOS Proofs: An Illustrative Example

2006English

A Comparative Analysis of the Complexity/Accuracy Tradeoff in Power Amplifier Behavioral Models

IEEE Transactions on Microwave Theory and Techniques
Electronic EngineeringRadiationElectricalCondensed Matter Physics
2010English

Policy Iteration-Based Conditional Termination and Ranking Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

On the Concrete Complexity of Zero-Knowledge Proofs

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy