Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Thomas Thierauf
The Complexity of Generating and Checking Proofs of Membership
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
A Note on the Complexity of Classical and Intuitionistic Proofs
On the Concrete Complexity of Zero-Knowledge Proofs
The Complexity of Model Checking for Propositional Default Logics
Data and Knowledge Engineering
Information Systems
Management
Complexity in Automation of SOS Proofs: An Illustrative Example
Formal Verification of a Group Membership Protocol Using Model Checking
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
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
Making Proofs Without Modus Ponens: An Introduction to the Combinatorics and Complexity of Cut Elimination
Bulletin of the American Mathematical Society
Mathematics
Applied Mathematics
