Approximability of Minimum AND-Circuits

DOI10.1007/11785293_28zbMATH Open1141.68655OpenAlexW1525116119MaRDI QIDQ5757887

Jan Arpe, Bodo Manthey

Publication date: 7 September 2007

Published in: Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/603/

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Related Items (1)

The Minimum Oracle Circuit Size Problem.

This page was built for publication: Approximability of Minimum AND-Circuits

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