PhD student at Durham University.
Interested in counting complexity, holographic algorithms, and more generally the impact of structural restrictions (like planarity) on the complexity of problems.
Member for 7 years, 8 months
3 profile views
Last seen Jul 24 '14 at 21:02
Top network posts
- 7 What are some methods for representing a weighted directed graph with a non-weighted directed graph while preserving some properties?
- 6 Complexity of counting MAXCUT in planar graphs -- seemingly contradicting claims
- 5 Proof of an Ising model representation of graph isomorphism problem
- View more network posts →
Keeping a low profile.
This user hasn't posted yet.
Sep 24 '14