Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

AuthID
 P-00X-T25
3
Author(s)
Document Type
Article
Year published
2019
Published
in J. Autom. Reason.
Volume: 63, Issue: 4, Pages: 813-855
Indexing
Dblp®/en/publications/view/976965
Publication Identifiers
Dblp: journals/jar/BaillotBL19
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

A place for researchers and their institutions

Useful Links

Get Help

© 2024 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service