Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pąk, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17.10.1007/978-3-319-20615-8_17Search in Google Scholar
Grzegorz Bancerek, Czesław Byliński, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pąk. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.10.1007/s10817-017-9440-6604425130069070Search in Google Scholar
Noboru Endou. Double series and sums. Formalized Mathematics, 22(1):57–68, 2014. doi:10.2478/forma-2014-0006.10.2478/forma-2014-0006Search in Google Scholar
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979. ISBN 0716710447.Search in Google Scholar
David S. Johnson. Near-optimal Bin Packing Algorithms. PhD thesis. Massachusetts Institute of Technology, 1973.Search in Google Scholar
B. Korte and J. Vygen. Combinatorial Optimization: Theory and Algorithms. Springer Publishing Company, Incorporated, 5th edition, 2012. ISBN 3642244874, 9783642244872.10.1007/978-3-642-24488-9Search in Google Scholar
Robert Milewski. Natural numbers. Formalized Mathematics, 7(1):19–22, 1998.Search in Google Scholar
Christoph Schwarzweller. Proth numbers. Formalized Mathematics, 22(2):111–118, 2014. doi:10.2478/forma-2014-0013.10.2478/forma-2014-0013Search in Google Scholar
