Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:22, 2 February 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
25 October 2019
0 references
implicit computational complexity
0 references
complexity analysis
0 references
linear dependent types
0 references
cryptographic proofs
0 references
