Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle
Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited
General Hardness Amplification of Predicates and Puzzles
On the randomness of independent experiments
Parallel repetition: simplifications and the no-signaling case
No associations
LandOfFree
Thomas Holenstein does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Thomas Holenstein, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Thomas Holenstein will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-70927