Time hierarchies for cryptographic function inversion with advice
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3489106 (Why is no real title available?)
- scientific article; zbMATH DE number 2019635 (Why is no real title available?)
- scientific article; zbMATH DE number 1507040 (Why is no real title available?)
- A Turing machine time hierarchy
- A generic time hierarchy with one bit of advice
- A hierarchy for nondeterministic time complexity
- Foundations of Cryptography
- From logarithmic advice to single-bit advice
- Hierarchies for semantic classes
- Non-deterministic exponential time has two-prover interactive protocols
- On the Computational Complexity of Algorithms
- On total functions, existence theorems and computational complexity
- One way functions and pseudorandom generators
- Pseudorandomness and average-case complexity via uniform reductions
- Separating Nondeterministic Time Complexity Classes
- The complexity theory companion
- Two-Tape Simulation of Multitape Turing Machines
Cited in
(4)
This page was built for publication: Time hierarchies for cryptographic function inversion with advice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q843601)