The complexity of identifying redundant and essential elements

DOI10.1016/0196-6774(81)90004-3MaRDI QIDQ3926037zbMATH OpenOpenAlexFDO

Authors Shlomo Moran, Yehoshua Perl

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90004-3

zbMATH Keywords

NP-hardoptimization problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

This page was built for publication: The complexity of identifying redundant and essential elements

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