You have Guest access.
Log In
Book Chapter
A Generic Set That Does Not Bound a Minimal Pair
Mariya Ivanova Soskova
Lecture Notes in Computer Science, 2006, Volume 3959, Theory and Applications of Models of Computation, Pages 746-755
Speed-Up Theorems in Type-2 Computation
Chung-Chih Li
Lecture Notes in Computer Science, 2007, Volume 4497, Computation and Logic in the Real World, Pages 478-487
Infinite Computations and a Hierarchy in Δ 3
Branislav Rovan and L’uboš Steskal
Lecture Notes in Computer Science, 2007, Volume 4497, Computation and Logic in the Real World, Pages 660-669
Complete Problems in the Arithmetic Hierarchy
Texts in Computer Science, 2006, Theory of Computation, Part 1, Pages 242-246
On the Equivalence of Generic Group Models
Tibor Jager and Jörg Schwenk
Lecture Notes in Computer Science, 2008, Volume 5324, Provable Security, Pages 200-209
Journal Article
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
Theory of Computing Systems, 2009, Volume 45, Number 4, Pages 880-896
On exponential lowness
R. Book, P. Orponen, D. Russo and O. Watanabe
Lecture Notes in Computer Science, 1986, Volume 226, Automata, Languages and Programming, Pages 40-49
Aggregation and Sparsity Via ℓ1 Penalized Least Squares
Florentina Bunea, Alexandre B. Tsybakov and Marten H. Wegkamp
Lecture Notes in Computer Science, 2006, Volume 4005, Learning Theory, Pages 379-391
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
Mihir Bellare
Lecture Notes in Computer Science, 2006, Volume 4117, Advances in Cryptology - CRYPTO 2006, Pages 602-619
Random Oracles and Auxiliary Input
Dominique Unruh
Lecture Notes in Computer Science, 2007, Volume 4622, Advances in Cryptology - CRYPTO 2007, Pages 205-223
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info