The Complexity of Generating and Checking Proofs of Membership

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-60922-9_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Note on the Complexity of Classical and Intuitionistic Proofs

2015English

On the Concrete Complexity of Zero-Knowledge Proofs

English

The Complexity of Model Checking for Propositional Default Logics

Data and Knowledge Engineering
Information SystemsManagement
2005English

Complexity in Automation of SOS Proofs: An Illustrative Example

2006English

Formal Verification of a Group Membership Protocol Using Model Checking

English

Errors in Computational Complexity Proofs for Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Complexity Tradeoff in Ranking-Function Termination Proofs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2008English

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach

2012English

Making Proofs Without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy