Conference
Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
| Τίτλος: | Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness |
|---|---|
| Συγγραφείς: | Lysikov, Vladimir, Walter, Michael |
| Πηγή: | 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :486-511 Dec, 2025 |
| Relation: | 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) |
| Βάση Δεδομένων: | IEEE Xplore Digital Library |
καταχωρήστε σχόλιο πρώτοι!