Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

Jump to content

Talk:Group isomorphism problem

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 7 years ago by 138.246.2.252 in topic Who solved this?

Who solved this?

[edit]

This article is missing one of the most basic facts: who proved this was undecidable, and when? Was it Novikov in 1955, when he proved the word problem was undecidable? --Dylan Thurston (talk) 01:02, 31 March 2016 (UTC)Reply

There seems to be confusion between this and NP-intermediate, which implies that Group Isomorphism is not only decidable, but no worse than NP-hard. 130.126.255.15 (talk) 20:00, 1 June 2016 (UTC)Reply

This article talks about finite _presented_ groups, while group isomorphism for finite groups is decidable and in NP. This is probably meant by the NP-intermediate article. --138.246.2.252 (talk) 12:03, 5 October 2018 (UTC)Reply