arXiv (All)open access

Ulam Median is NP-hard for Four Permutations

Habib, Mursalin

arXiv (All) · Papers · License: Open Access

computational complexity

This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Record · ID 987773
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.