Pages that link to "Item:Q3060197"
From MaRDI portal
The following pages link to The computational SLR: a logic for reasoning about computational indistinguishability (Q3060197):
Displaying 5 items.
- Formal security proofs with minimal fuss: implicit computational complexity at work (Q2343128) (← links)
- A higher-order characterization of probabilistic polynomial time (Q2343130) (← links)
- Program equivalence in linear contexts (Q2346993) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- A Formalization of Polytime Functions (Q3088001) (← links)
