Pages that link to "Item:Q2343128"
From MaRDI portal
The following pages link to Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128):
Displaying 3 items.
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (Q3460055) (← links)