skip to main content
Refinado por: Base de dados/Biblioteca: SpringerLink (Online service) remover tipo de recurso: Book Chapters remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
Material Type:
Capítulo de Livro
Adicionar ao Meu Espaço

Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs

Davis, Martin ; Fehnker, Ansgar ; McIver, Annabelle ; Voronkov, Andrei

Journal of automated reasoning, 2015, Vol.9450 (4), p.203-218 [Periódico revisado por pares]

Germany: Springer Berlin / Heidelberg

Texto completo disponível

Buscando em bases de dados remotas. Favor aguardar.