Sorting under partial information (without the ellipsoid algorithm)

DOI10.1145/1806689.1806740MaRDI QIDQ6828589zbMATH OpenFDO

Authors Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://dipot.ulb.ac.be/dspace/bitstream/2013/163335/1/0911.0086.pdf

zbMATH Keywords

partial ordergraph entropy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17) Searching and sorting (68P10) Combinatorics of partially ordered sets (06A07)

Cited in

(1)

• Fast and simple sorting using partial information

This page was built for publication: Sorting under partial information (without the ellipsoid algorithm)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828589)