From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Lower Bounds for Modular Counting by Circuits with Modular Gates., и . LATIN, том 911 из Lecture Notes in Computer Science, стр. 60-71. Springer, (1995)Regular Languages in NC¹., , , и . J. Comput. Syst. Sci., 44 (3): 478-499 (1992)Some results on C-varieties., и . RAIRO Theor. Informatics Appl., 39 (1): 239-262 (2005)On uniformity within NC1., , и . SCT, стр. 47-59. IEEE Computer Society, (1988)Piecewise Testable Tree Languages., , и . LICS, стр. 442-451. IEEE Computer Society, (2008)Finite automata and computational complexity., и . Formal Properties of Finite Automata and Applications, том 386 из Lecture Notes in Computer Science, стр. 199-233. Springer, (1988)Complex Polynomials and Circuit Lower Bounds for Modular Counting., и . LATIN, том 583 из Lecture Notes in Computer Science, стр. 24-31. Springer, (1992)The Power of Local Self-Reductions., и . SCT, стр. 277-285. IEEE Computer Society, (1995)Lower bounds for modular counting by circuits with modular gates., и . Comput. Complex., 8 (3): 258-272 (1999)Finite Semigroup Varieties Defined by Programs., , и . Theor. Comput. Sci., 180 (1-2): 325-339 (1997)