Skip to content
Archive of posts filed under the Complexity category.

iSquared: The limits of Computation

The cover article of this quarter’s iSquared magazine is by me!

Geometry Club Talk: Computational aspects of ECDLP

Notes from my geometry club talk given April 18th, 2008.

Addition Chains

Fast addition (or exponentiation) via addition chains.

The Secrecy Problem

Link to an E2 writeup on reducing the secrecy problem to Post’s Correspondence Problem.

Hard problems in graph theory

BICS Seminar by Keith Briggs.

NP vs Co-NP

Notes from a talk on complexity theory and logic.