Polynomial-Time Algorithms for Checking Some Properties of Boolean Functions Given by Polynomials.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 383, doi. 10.1007/s00224-014-9578-0
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2016 AND VI 58 AND IP 3
Results: 8
1
2
Reducibilities Relating to Schnorr Randomness.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 441, doi. 10.1007/s00224-014-9583-3
- By:
- Publication type:
- Article
3
The Sum 2 Over All Prefixes x of Some Binary Sequence Can be Infinite.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 424, doi. 10.1007/s00224-014-9604-2
- By:
- Publication type:
- Article
4
Relating and Contrasting Plain and Prefix Kolmogorov Complexity.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 482, doi. 10.1007/s00224-015-9636-2
- By:
- Publication type:
- Article
5
Algorithmic Minimal Sufficient Statistics: a New Approach.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 463, doi. 10.1007/s00224-014-9605-1
- By:
- Publication type:
- Article
6
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 403, doi. 10.1007/s00224-015-9632-6
- By:
- Publication type:
- Article
7
Editorial: Special Issue on Computability, Complexity and Randomness.
- Published in:
- 2016
- By:
- Publication type:
- Editorial
8
Normality and Finite-State Dimension of Liouville Numbers.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 3, p. 392, doi. 10.1007/s00224-014-9554-8
- By:
- Publication type:
- Article