Computational complexity and 3-manifolds and zombies
Article by Greg Kuperberg and Eric Samperton
In collections: Attention-grabbing titles, Basically computer science
We show the problem of counting homomorphisms from the fundamental group of a homology \(3\)-sphere \(M\) to a finite, non-abelian simple group \(G\) is -complete, in the case that \(G\) is fixed and \(M\) is the computational input....
Entry: read.somethingorotherwhatever.

· · tooter · 0 · 2 · 2
Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!