Multilist layering: Complexity and applications

DOI10.1016/0304-3975(94)00213-3zbMath0873.68060OpenAlexW2139494869MaRDI QIDQ673793

Anil Maheshwari, Andrzej Lingas, Anders Dessmark

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00213-3

zbMATH Keywords

convex layer problemmultilist layering

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper envelope onion peeling
• Efficient piecewise-linear function approximation using the uniform metric
• On the convex layers of a planar set
• Efficient parallel convex hull algorithms

This page was built for publication: Multilist layering: Complexity and applications