Timeline for Are there any computational problems in groups that are harder than P?
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2023 at 12:48 | comment | added | ADL | I think the fixed-point-free statement should be "The problem of determining whether $G$ has a fixed point free automorphism is NP-complete, even when $\operatorname{Aut}(G)$ is an elementary abelian 2-group"? | |
| Oct 11, 2021 at 17:59 | comment | added | Dylan Thurston | That NP-complete problem you quote is missing some context: what type of space is $G$ acting on? | |
| Feb 2, 2019 at 10:44 | history | answered | Carl-Fredrik Nyberg Brodda | CC BY-SA 4.0 |