Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (Q3460055): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-662-48899-7_15 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2290798421 / rank | |||
Normal rank | |||
Latest revision as of 01:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs |
scientific article |
Statements
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (English)
0 references
12 January 2016
0 references
