On the complexity of sorting Cartesian products of partially ordered sets

DOI10.1515/DMA.2001.11.4.373zbMATH Open1088.68838OpenAlexW2046888310MaRDI QIDQ4809532

Author name not available (Why is that?)

Publication date: 30 August 2004

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2001.11.4.373

Mathematics Subject Classification ID

No records found.

This page was built for publication: On the complexity of sorting Cartesian products of partially ordered sets

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