1. Lenore Blum, Felipe Cucker, Michael Shub & Steve Smale (1998). Complexity and real computation. Springer-Verlag.
2. Béla Bollobás (1998). Modern graph theory, volume 184 of Graduate Texts in Mathematics. Springer-Verlag.
3. Graham Brightwell & Peter Winkler (2005). Counting Eulerian circuits is #P-Complete. In Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, Vancouver, BC, Canada, 259–262. Society for Industrial and Applied Mathematics.
4. Valentin E. Brimkov & Stefan S. Dantchev (2000). On the com plexity of integer programming in the Blum-Shub-Smale computational model. In Proceedings of Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference 2000, Sendai, Japan, 286–300. Springer-Verlag.
5. Andrei Bulatov, Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius & David Richerby (2009). The complexity of weighted boolean #CSP with mixed signs. Theoretical Computer Science 410, 3949–3961.