Timeline for Polynomial algorithms for UPB (Unextendable Product Bases)
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27, 2011 at 10:23 | comment | added | Marcin Kotowski | yes, but I'm potentially interested in finding as many inequivalent (say, with respect to local unitaries) UPBs as possible. Full classification is known only for simple cases like 2x2x2. | |
| Mar 27, 2011 at 4:31 | history | answered | Peter Shor | CC BY-SA 2.5 |