Result 461 to 480 of 498 total
On the topological size of sets of random strings. (English)
Z. Math. Logik Grundlagen Math. 32, 81-88 (1986).
461
The effect of doubling entropy. (English)
Sov. Math., Dokl. 32, 496-499 (1985); translation from Dokl. Akad. Nauk SSSR 284, 795-798 (1985).
462
Generalized entrance and hierarchy of complexities. (Russian)
Complexity problems of mathematical logic, Collect. sci. Works, Kalinin 1985, 27-32 (1985).
463
On the structure of one-tape nondeterministic Turing machine time hierarchy. (English)
Theor. Comput. Sci. 40, 175-193 (1985).
464
P. Martin-Löf tests: representability and embeddability. (English)
Rev. Roum. Math. Pures Appl. 30, 719-732 (1985).
465
An $n\sp{1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape. (English)
Inf. Process. Lett. 21, 147-152 (1985).
466
Square time is optimal for simulation of one pushdown store or one queue by an oblivious one-head tape unit. (English)
Inf. Process. Lett. 21, 87-91 (1985).
467
Coding strings by pairs of strings. (English)
SIAM J. Algebraic Discrete Methods 6, 445-461 (1985).
468
Solving undirected graph problems on VLSI. (English)
SIAM J. Comput. 14, 527-544 (1985).
469
Randomness conservation inequalities; information and independence in mathematical theories. (English)
Inf. Control 61, 15-37 (1984).
470
A relation between correctness and randomness in the computation of probabilistic algorithms. (English)
Int. J. Comput. Math. 16, 47-53 (1984).
471
Inductive Turing machines. (English)
Sov. Math., Dokl. 27, 730-734 (1983); translation from Dokl. Akad. Nauk SSSR 270, 1289-1293 (1983).
472
On the complexity and reducibility of algorithmic mass problems. (English)
Sov. Math., Dokl. 28, 369-373 (1983); translation from Dokl. Akad. Nauk SSSR 272, 289-293 (1983).
473
Coding strings by pairs of strings. (English)
Combinatorics, graph theory and computing, Proc. 14th Southeast. Conf., Boca Raton/Flo. 1983, Congr. Numerantium 39, 183-191 (1983).
474
Some characteristics of the process measure of the amount of information. (English)
Publ. Inst. Math., Nouv. Sér. 33(47), 235-238 (1983).
475
On representability of P. Martin-Loef tests. (English)
Kybernetika 19, 42-47 (1983).
476
A natural encoding scheme proved probabilistic polynomial complete. (English)
Theor. Comput. Sci. 24, 291-300 (1983).
477
On Kolmogorov’s subrecursive algorithmic complexity. (English)
Vestn. Leningr. Univ., Math. 11, 301-307 (1983).
478
Kolmogorov relative complexity on the basis of use of repetitions and local operations. (Russian)
Vopr. Kibern., Mosk. 75, 165-180 (1982).
479
Komplexität von Sortierproblemen und Anwendungen der Kolmogoroff- Komplexität. (German)
Fakultät für Mathematik der Universität Bielefeld. 164 S. (1982).
480
Result 461 to 480 of 498 total
Start
Contact
Print
General Help
