2 search results - page 1 / 1 » A fast method to derive minimum SOPs for decomposable functi... |
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
- This paper shows that divide-and-conquer derives a minimum sum-of-products expression (MSOP) of functions that have an AND bi-decomposition when at least one of the subfunctions ...
SIAMJO
2010
12 years 11 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...