Biclique Coverings, Rectifier Networks and the Cost of ε-Removal

We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number Cov(G) and the minimal rectifier network size Rect(G) of a bipartite graph G. We show that there exist graphs with Cov(G) ≥ Rect(G)3/2 − e . As a corollary, we establish that there exist nondeterministic finite automata (NFAs) with e-transitions, having n transitions total such that the smallest equivalent e-free NFA has Ω(n 3/2 − e ) transitions. We also formulate a version of previous bounds for the weighted set cover problem and discuss its connections to giving upper bounds for the possible blow-up.