Conference
Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings)
| Τίτλος: | Computing the Polytope Diameter is Even Harder than NP-hard (Already for Perfect Matchings) |
|---|---|
| Συγγραφείς: | Wulf, Lasse |
| Πηγή: | 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2025 IEEE 66th Annual Symposium on. :531-551 Dec, 2025 |
| Relation: | 2025 IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS) |
| Βάση Δεδομένων: | IEEE Xplore Digital Library |
καταχωρήστε σχόλιο πρώτοι!