N. Yu. Zolotykh, V. N. Shevchenko, “Estimating the complexity of deciphering a threshold functions in a <nobr>$k$</nobr>-valued logic”, Zh. Vychisl. Mat. Mat. Fiz., 1999, Volume 39, Number 2,Pages <nobr>346

JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 1999 Volume 39, Number 2, Pages 346–352 (Mi zvmmf1746)

This article is cited in 9 papers

Estimating the complexity of deciphering a threshold functions in a $k$-valued logic

N. Yu. Zolotykh, V. N. Shevchenko

N. I. Lobachevski State University of Nizhni Novgorod

UDC: 519.714.4

MSC: Primary 06E30; Secondary 94C10, 90C09, 68Q25, 03B50

Received: 04.12.1996
Revised: 25.12.1997

English version: Computational Mathematics and Mathematical Physics, 1999, 39:2, 328–334

Bibliographic databases: