On the complexity of computing certain systems of Boolean functions by circuits of functional elements

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. Regular cuts and some facets in problems of discrete optimization

   Simanchev, R. Yu. · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
4. Algorithms for solving certain submodular optimization problems

   Reddy, Swarna Kumari · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics
5. Mean-square synthesis on admissible sets determined by realizability conditions

   Shaganova, Olga Igorevna · 1994 · Candidate of Sciences

   • 01.01.09 Discrete mathematics and mathematical cybernetics

All works in this specialty