Timeline for Efficient way of determining isomorphism
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 3, 2010 at 23:45 | answer | added | Rune | timeline score: 0 | |
| May 2, 2010 at 12:17 | history | edited | Neel Krishnaswami |
edited tags
|
|
| May 2, 2010 at 8:08 | comment | added | Antonio E. Porreca | I think both the “complexity-theory” and “algorithms” tags are relevant to this question. | |
| May 2, 2010 at 3:14 | answer | added | Joel David Hamkins | timeline score: 6 | |
| May 1, 2010 at 23:23 | answer | added | David Eppstein | timeline score: 17 | |
| May 1, 2010 at 22:56 | answer | added | Victor Miller | timeline score: 3 | |
| May 1, 2010 at 22:42 | comment | added | Steve Huntsman | Deleted my misleading answer referencing the fact that graph isomorphism is in NP. You need a certificate, which could be (e.g.) a permutation matrix that effects the isomorphism. | |
| May 1, 2010 at 22:02 | history | asked | Oscar Leroy | CC BY-SA 2.5 |