R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Consider the number of n-bit strings that have exactly the maximum possible program-size complexity that an n-bit string can have. We show that this number is itself an n-bit string with nearly the maximum possible complexity. From this it follows that at least 2n-c n-bit strings have exactly the maximum complexity that it is possible for an n-bit string to have. © 1993.
R.A. Brualdi, A.J. Hoffman
Linear Algebra and Its Applications
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
Karthik Visweswariah, Sanjeev Kulkarni, et al.
IEEE International Symposium on Information Theory - Proceedings
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering