(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography
cs.PL, cs.CR
Submitted: 2026-10-10
Updated: 2026-10-10
Related papers
- Language-Based Agent Control
- ANEForge: Python for direct computation on the Apple Neural Engine
- Volition Elicitation: Operational Semantics for People and Their Machines
- Griotte: Verified Compartmentalisation via Capabilities
- GraphMend: Code Transformations for Fixing Graph Breaks in PyTorch 2
- Two Birds One Stone: Effective Static Detection of Resource and Communication Deadlocks in Rust Programs