Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

AuthID
 P-00X-T25
3
Author(s)
Tipo de Documento
Article
Year published
2019
Publicado
in J. Autom. Reason.
Volume: 63, Número: 4, Páginas: 813-855
Indexing
Dblp®/pt/publications/view/976965
Publication Identifiers
DBLP: journals/jar/BaillotBL19
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2025 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service