Eric Samperton

According to our database, Eric Samperton authored at least 10 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Obstruction theory and the complexity of counting group homomorphisms.

Eric Samperton, Armin Weiß

CoRR, February, 2026

2025

On the hardness of approximating minimum distances of quantum codes.

Elena Grigorescu, Vatsal Jha, Eric Samperton

CoRR, September, 2025

An elementary proof that linking problems are hard.

Shannon Cheng, Anna Chlopecki, Saarah Nazar, Eric Samperton

CoRR, September, 2025

Towards a Complexity-Theoretic Dichotomy for TQFT Invariants.

Nicolas Bridges, Eric Samperton

Proceedings of the 20th Conference on the Theory of Quantum Computation, 2025

On the Hardness of Approximating Distances of Quantum Codes.

Elena Grigorescu, Vatsal Jha, Eric Samperton

Proceedings of the 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2025

An Algorithm for Tambara-Yamagami Quantum Invariants of 3-Manifolds, Parameterized by the First Betti Number.

Colleen Delaney, Clément Maria, Eric Samperton

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2022

Topological quantum computation is hyperbolic.

Eric Samperton

CoRR, 2022

2019

Coloring invariants of knots and links are often intractable.

Greg Kuperberg, Eric Samperton

CoRR, 2019

2018

Computational Complexity of Enumerative 3-Manifold Invariants.

Eric Samperton

CoRR, 2018

2017

Computational complexity and 3-manifolds and zombies.

Greg Kuperberg, Eric Samperton

CoRR, 2017