Succinct Representation, Random Strings, and Complexity Classes

Gary L. Peterson. Succinct Representation, Random Strings, and Complexity Classes. In 21st Annual Symposium on Foundations of Computer Science, 13-15 October 1980, Syracuse, New York, USA. pages 86-95, IEEE, 1980.

Abstract

Abstract is missing.