Feasible Analysis, Randomness, and Base Invariance.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 439, doi. 10.1007/s00224-013-9507-7
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2015 AND VI 56 AND IP 3
Results: 8
1
2
On Optimal Language Compression for Sets in PSPACE/poly.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 581, doi. 10.1007/s00224-014-9535-y
- By:
- Publication type:
- Article
3
Cryptography and Algorithmic Randomness.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 544, doi. 10.1007/s00224-014-9545-9
- By:
- Publication type:
- Article
4
Symbolic Dynamics: Entropy = Dimension = Complexity.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 527, doi. 10.1007/s00224-014-9546-8
- By:
- Publication type:
- Article
5
Topological Arguments for Kolmogorov Complexity.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 513, doi. 10.1007/s00224-015-9606-8
- By:
- Publication type:
- Article
6
Trivial Measures are not so Trivial.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 487, doi. 10.1007/s00224-015-9614-8
- By:
- Publication type:
- Article
7
Editorial.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
8
Schnorr Triviality and Its Equivalent Notions.
- Published in:
- Theory of Computing Systems, 2015, v. 56, n. 3, p. 465, doi. 10.1007/s00224-013-9506-8
- By:
- Publication type:
- Article