Computer Science – Computational Complexity
Scientist
Computer Science
Computational Complexity
Scientist
A Simple Explicit Construction of an $n^{\Tilde{O}(\log n)}$-Ramsey Graph
Lower Bounds on Signatures from Symmetric Primitives
Making the long code shorter, with applications to the Unique Games Conjecture
Merkle Puzzles are Optimal
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes
No associations
LandOfFree
Boaz Barak does not yet have a rating. At this time, there are no reviews or comments for this scientist.
If you have personal experience with Boaz Barak, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Boaz Barak will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-P-188132