( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logical Operations and Kolmogorov Complexity II.

, и . CCC, стр. 256-265. IEEE Computer Society, (2001)

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.

Nikolai Stuloff

Nikolai Piepgras

Nikolai Achwerdoff

Nikolai Janakiev

Regine Nikolai

 

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

Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle., , , и . CSL, том 2471 из Lecture Notes in Computer Science, стр. 74-88. Springer, (2002)A new class of non-Shannon-type inequalities for entropies., , , и . Commun. Inf. Syst., 2 (2): 147-166 (2002)Half-duplex communication complexity with adversary? can be less than the classical communication complexity., и . Electron. Colloquium Comput. Complex., (2023)Arthur-Merlin Games in Boolean Decision Trees., , , и . J. Comput. Syst. Sci., 59 (2): 346-372 (1999)Proofs of conservation inequalities for Levin's notion of mutual information of 1974.. Theor. Comput. Sci., (2021)Logical operations and Kolmogorov complexity., и . Theor. Comput. Sci., 271 (1-2): 125-129 (2002)Inverting Onto Functions and Polynomial Hierarchy., , , , и . CSR, том 4649 из Lecture Notes in Computer Science, стр. 92-103. Springer, (2007)Randomised Individual Communication Complexity., , и . CCC, стр. 321-331. IEEE Computer Society, (2008)Basic set theory., и . Student mathematical library American Mathematical Society, (2002)Banishing Robust Turing Completeness., , и . Int. J. Found. Comput. Sci., 4 (3): 245-265 (1993)