Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover
From MaRDI portal
Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.