A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Biclique coverings, rectifier networks and the cost of ε-removal
[article]
2014
arXiv
pre-print
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 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. ...
We showed that the cost of ε-removal from NFAs is worst-case Ω(n 3/2−ǫ ), improving the previous bound Ω(n log 2 n). ...
arXiv:1406.0017v1
fatcat:ywaxx47yrbf4lgzkmr6fbb26yi
Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
[chapter]
2014
Lecture Notes in Computer Science
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 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. ⋆ ...
We showed that the cost of ε-removal from NFAs is worst-case Ω(n 3/2−ǫ ), improving the previous bound Ω(n log 2 n). ...
doi:10.1007/978-3-319-09704-6_16
fatcat:ryftga3625ffxdc3mlpw7yw3su
OASIcs, Volume 85, ATMOS 2020, Complete Volume
[article]
2020
As many passenger and freight trains as possible should be able to use the infrastructure, of course in compliance with the necessary safety requirements. ...
Therefore, it is increasingly important to optimize the exploitation of the infrastructure capacity. ...
Then the second step computes the fact that A and P (5) cover each other but not A and P (6) . Thus, P (3) and P (4) are removed too. Since P (5) and B cover each other, P (6) is removed. ...
doi:10.4230/oasics.atmos.2020
fatcat:cfergu24w5f73ajydwnxvac3p4