On lower bounds for the time of computation

Articles in the same Issue

1. The Newton sums method in combinatorial optimization
2. Kerdock code in a cyclic form
3. On the conditions of regularity for finite autonomous automata
4. On lower bounds for the time of computation
5. Stochasticity of the languages acceptable by two-way finite probabilistic automata
6. On completeness of the binary boundedly determined functions with respect to superposition
7. Weighings, allocations, and the embeddability of partitions
8. On the circle method
9. Distribution of the permanent of a random Boolean matrix