Clik here to view.
A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details
Update 2017-01-09: Laci claims to have found a workaround to the previously posted error, and the claim is again quasipolynoimal time! Updated arXiv paper to follow. Update 2017-01-04: Laci has posted...
View ArticleClik here to view.
Hashing to Estimate the Size of a Stream
Problem: Estimate the number of distinct items in a data stream that is too large to fit in memory. Solution: (in python) import random def randomHash(modulus): a, b = random.randint(0,modulus-1),...
View ArticleModulus Switching in LWE
The Learning With Errors problem is the basis of a few cryptosystems, and a foundation for many fully homomorphic encryption (FHE) schemes. In this article I’ll describe a technique used in some of...
View ArticleClik here to view.
Two’s Complement and Group Theory
Before I discovered math, I was a first year undergrad computer science student taking Electrical Engineering 101. The first topic I learned was what bits and boolean gates are, and the second was the...
View ArticleClik here to view.
Socks, a matching game based on an additive combinatorics problem
Can you find a set of cards among these six, such that the socks on the chosen cards can be grouped into matching pairs? (Duplicate pairs of the same sock are OK) Spoilers If the cards are indexed as...
View Article
