On the complexity of sorting Cartesian products of partially ordered sets
type: Item
instance of: scholarly article
title: On the complexity of sorting Cartesian products of partially ordered sets
zbMATH Open document ID: 1088.68838
author: Yu. B. Nikitin
published in: Discrete Mathematics and Applications
publication date: 2004-08-30T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 06A07
zbMATH DE Number: 2095468
MaRDI profile type: Publication
full work available at URL: dma.2001.11.4.373
OpenAlex ID: W2046888310
DOI: 10.1515/DMA.2001.11.4.373
description: scientific article; zbMATH DE number 2095468