Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs |
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
0 references
0 references
0 references
