Number of solutions to the biclique cover problem
Given a Graph $G=(V, E),$ it takes $O(|V|^3)$ delay and $O(2^|V|)$space to find all bicliques  in lexicographical order in $G$ [1]. There is no polynomial-delay enumeration algorithm for all bicliques in reverse lexicographical order unless P=NP [2].

Given a bipartite graph $G=(U, V, E),$ it takes $O((|U|+|V|)^2)$ delay with exponential space to find all maximal bicliques in $G$ in lexicographical order in $U$ [3]. 

[1] Vania M.F. Dias, Celina M.H. de Figueiredo, and Jayme L. Szwarcfiter.
“Generating Bicliques of a Graph in Lexicographic Order”. In:
Theoretical Computer Science 337.1-3 (June 2005), pp. 240–248. doi:
10.1016/j.tcs.2005.01.014.

[2] Wasa, Kunihiro. "Enumeration of enumeration algorithms." arXiv preprint arXiv:1605.05102 (2016).

[3] Alain Gely, Lhouari Nourine, and Bachir Sadi. “Enumeration aspects
of maximal cliques and bicliques”. In: Discrete Applied Mathematics
157.7 (Apr. 2009), pp. 1447–1459. doi: 10.1016/j.dam.2008.10.
010.