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
Περιγραφή
ISBN:9798331571320
9798331571337
ISSN:25758454
15238288
DOI:10.1109/FOCS63196.2025.00027