Amanote Research
Register
Sign In
Complexity in Automation of SOS Proofs: An Illustrative Example
doi 10.1109/cdc.2006.377629
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2006
Authors
Dennice Gayme
Maryam Fazel
John C Doyle
Publisher
IEEE
Related search
Demand Management: An Illustrative Example
Meta-Analysis in Higher Education: An Illustrative Example Using Hierarchical Linear Modeling
Research in Higher Education
Education
Errors in Computational Complexity Proofs for Protocols
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Complexity Tradeoff in Ranking-Function Termination Proofs
Acta Informatica
Computer Networks
Software
Information Systems
Communications
On the Concrete Complexity of Zero-Knowledge Proofs
The Complexity of Design Automation Problems
The Complexity of Generating and Checking Proofs of Membership
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Note on the Complexity of Classical and Intuitionistic Proofs
Making Proofs Without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination
Bulletin of the American Mathematical Society
Mathematics
Applied Mathematics
