1 research outputs found
Biclique coverings, rectifier networks and the cost of -removal
We relate two complexity notions of bipartite graphs: the minimal weight
biclique covering number and the minimal rectifier network
size of a bipartite graph . We show that there exist
graphs with . As a
corollary, we establish that there exist nondeterministic finite automata
(NFAs) with -transitions, having transitions total such that
the smallest equivalent -free NFA has
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.Comment: 12 pages, to appear in proceedings of DCFS 2014: 16th International
Conference on Descriptional Complexity of Finite-State System