|
|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1999, Volume 39, Number 2, Pages 346–352
(Mi zvmmf1746)
|
|
|
|
This article is cited in 9 scientific papers (total 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
Received: 04.12.1996 Revised: 25.12.1997
Citation:
N. Yu. Zolotykh, V. N. Shevchenko, “Estimating the complexity of deciphering a threshold functions in a $k$-valued logic”, Zh. Vychisl. Mat. Mat. Fiz., 39:2 (1999), 346–352; Comput. Math. Math. Phys., 39:2 (1999), 328–334
Linking options:
https://www.mathnet.ru/eng/zvmmf1746 https://www.mathnet.ru/eng/zvmmf/v39/i2/p346
|
|