Functional measure of the complexity of computations in automaton circuits

More works in this specialty

1. On probabilities of values of random Boolean expressions

   Yashunskiy, Aleksey Dmitrievich · 2006 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
2. Coding of stochastic context-free languages

   Zhil'tsova, Larisa Pavlovna · 2004 · Doctor of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
3. On computable approximations of a certain algorithmically random sequence

   Smirnova, Olga Sergeevna · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
4. Complexity of approximation of irrational numbers by rationals

   Marzuk, El Oveykhan · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
5. Discrete control in systems with incomplete feedback

   Gavrina, O. M. · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics

All works in this specialty