For citations:
Naidenko V.G. Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time. Informatics. 2018;15(4):99-101. (In Russ.)
Views: 216
Fullscreen
Popular articles
Vol 16, No 4 (2019)
Vol 15, No 1 (2018)
No 2 (2013)
Article Tools
Email this article (Login required)
Email the author (Login required)
Email this article (Login required)
Email the author (Login required)
About the Author
Keywords
Boolean function
CMOS circuits
FPGA
Shannon expansion
VHDL
algorithm
classification
convolutional neural network
deep learning
disjunctive normal form
information security
machine learning
mathematical model
mathematical models
neural network
neural networks
physical cryptography
simulation
system of Boolean functions
two-sided boundary conditions
verification
220012, Minsk, Surganov Str 6.
The United Institute of Informatics Problems
of the National Academy of Sciences of Belarus
(UIIP NASB)
e-mail: rio@newman.bas-net.by
