COMPLEXITY THEORETIC APPROACH TO RANDOMNESS.

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1983, Pages 330-335

  Sipser, Michael ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; KOLMOGOROV COMPLEXITY; POLYNOMIALS; RANDOMNESS; THEOREMS;

COMPUTER METATHEORY;

EID: 0020931594     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (0)