Approximability of minimum AND-circuits
From MaRDI portal
Publication:1024782
DOI10.1007/s00453-007-9039-0zbMath1172.68061OpenAlexW2057316079MaRDI QIDQ1024782
Publication date: 17 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2006/603/
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for combinatorial problems
- Some simplified NP-complete graph problems
- Some APX-completeness results for cubic graphs
- The minimum equivalent DNF problem and shortest implicants
- Complexity of approximating bounded variants of optimization problems
- Circuit minimization problem
- The Smallest Grammar Problem
- Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
- Computing Sequences with Addition Chains
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Complexity of Monotone Networks for Computing Conjunctions
- Efficient Generation of Minimal Length Addition Chains
- Grammar-based codes: a new class of universal lossless source codes
- The macro model for data compression (Extended Abstract)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries
This page was built for publication: Approximability of minimum AND-circuits
