Timeline for Problems with complexity between P and NP that have NP-complete generalizations
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 7, 2012 at 20:05 | vote | accept | sma | ||
| Apr 6, 2012 at 6:03 | vote | accept | sma | ||
| Apr 7, 2012 at 20:05 | |||||
| Apr 6, 2012 at 5:55 | comment | added | Suresh Venkat | In particular, one generalization of GI is subgraph isomorphism, which is NPC | |
| Apr 5, 2012 at 17:17 | history | answered | Yixin Cao | CC BY-SA 3.0 |