Time hierarchies for cryptographic function inversion with advice
From MaRDI portal
Publication:843601
DOI10.1007/S10958-009-9403-5zbMATH Open1178.94188OpenAlexW1965029291MaRDI QIDQ843601FDOQ843601
Authors: K. V. Pervyshev, Dima Grigoriev, Edward A. Hirsch 
Publication date: 15 January 2010
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/21.11116/0000-0004-268E-2
Recommendations
Cites Work
- On the Computational Complexity of Algorithms
- Foundations of Cryptography
- Non-deterministic exponential time has two-prover interactive protocols
- One way functions and pseudorandom generators
- Separating Nondeterministic Time Complexity Classes
- Pseudorandomness and average-case complexity via uniform reductions
- On total functions, existence theorems and computational complexity
- Two-Tape Simulation of Multitape Turing Machines
- Title not available (Why is that?)
- The complexity theory companion
- A Turing machine time hierarchy
- A hierarchy for nondeterministic time complexity
- Title not available (Why is that?)
- A generic time hierarchy with one bit of advice
- From logarithmic advice to single-bit advice
- Hierarchies for semantic classes
- Title not available (Why is that?)
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)
