Pages that link to "Item:Q2921408"
From MaRDI portal
The following pages link to Nearly Tight Approximability Results for Minimum Biclique Cover and Partition (Q2921408):
Displaying 10 items.
- Property testing of the Boolean and binary rank (Q825974) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- Upper bounds on the Boolean rank of Kronecker products (Q2146742) (← links)
- On the intractability landscape of digraph intersection representations (Q2169961) (← links)
- Toward quality assessment of Boolean matrix factorizations (Q2198096) (← links)
- Efficient approximation for restricted biclique cover problems (Q2331611) (← links)
- The biclique covering number of grids (Q2335697) (← links)
- The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions (Q4592948) (← links)
- (Q6068263) (← links)
- Modeling combinatorial disjunctive constraints via junction trees (Q6120845) (← links)