Conceptio
›
Archive
›
arXiv (All)
arXiv (All)
open access
Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
Azgor, Sk Ruhul et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗
Direct PDF ↓
computational-complexity
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 973494
Retrieved via
Conceptio
— every document is proof-bundled with source, license, and retrieval metadata.