default search action
"NP-Completeness of the Combinatorial Distance Matrix Realisation Problem."
David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff (2024)
- David L. Fairbairn, George B. Mertzios, Norbert Peyerimhoff:
NP-Completeness of the Combinatorial Distance Matrix Realisation Problem. CoRR abs/2406.14729 (2024)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.