Timeline for Program for computing group cohomology
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 20, 2019 at 5:11 | comment | added | Joshua Grochow | For groups given by matrix generators over $\mathbb{Z}$ this is certainly true, but for groups given by matrix generators over a finite field (another common setting), certainly most questions are decidable, and the question then becomes one of whether there are provably efficient algorithms and/or practical implementations. | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Mar 29, 2012 at 15:29 | history | answered | Igor Rivin | CC BY-SA 3.0 |