3 research outputs found
Computing the Maximum using (min, +) Formulas
We study computation by formulas over (min,+). We consider the
computation of max{x_1,...,x_n} over N as a difference of
(min,+) formulas, and show that size n + n log n is sufficient
and necessary. Our proof also shows that any (min,+) formula
computing the minimum of all sums of n-1 out of n variables must
have n log n leaves; this too is tight. Our proofs use a
complexity measure for (min,+) functions based on minterm-like
behaviour and on the entropy of an associated graph
Lower bounds on dynamic programming for maximum weight independent set
Publisher Copyright: © 2021 Tuukka Korhonen.We prove lower bounds on pure dynamic programming algorithms for maximum weight independent set (MWIS). We model such algorithms as tropical circuits, i.e., circuits that compute with max and + operations. For a graph G, an MWIS-circuit of G is a tropical circuit whose inputs correspond to vertices of G and which computes the weight of a maximum weight independent set of G for any assignment of weights to the inputs. We show that if G has treewidth w and maximum degree d, then any MWIS-circuit of G has 2Ω(w/d) gates and that if G is planar, or more generally H-minor-free for any fixed graph H, then any MWIS-circuit of G has 2Ω(w) gates. An MWIS-formula is an MWIScircuit where each gate has fan-out at most one. We show that if G has treedepth t and maximum degree d, then any MWIS-formula of G has 2Ω(t/d) gates. It follows that treewidth characterizes optimal MWIS-circuits up to polynomials for all bounded degree graphs and H-minor-free graphs, and treedepth characterizes optimal MWIS-formulas up to polynomials for all bounded degree graphs.Peer reviewe
Notes on Boolean Read-k and Multilinear Circuits
A monotone Boolean (OR,AND) circuit computing a monotone Boolean function f
is a read-k circuit if the polynomial produced (purely syntactically) by the
arithmetic (+,x) version of the circuit has the property that for every prime
implicant of f, the polynomial contains at least one monomial with the same set
of variables, each appearing with degree at most k. Every monotone circuit is a
read-k circuit for some k. We show that already read-1 (OR,AND) circuits are
not weaker than monotone arithmetic constant-free (+,x) circuits computing
multilinear polynomials, are not weaker than non-monotone multilinear
(OR,AND,NOT) circuits computing monotone Boolean functions, and have the same
power as tropical (min,+) circuits solving combinatorial minimization problems.
Finally, we show that read-2 (OR,AND) circuits can be exponentially smaller
than read-1 (OR,AND) circuits.Comment: A throughout revised version. To appear in Discrete Applied
Mathematic