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.

 

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

Hardness of Approximation Algorithms on k-SAT and (k, s)-SAT Problems., и . ICYCS, стр. 60-64. IEEE Computer Society, (2008)NP-Completeness of (k-SAT, r-UNk-SAT) and (LSAT>=k, r-UNLSAT>=k)., и . FAW, том 5059 из Lecture Notes in Computer Science, стр. 79-88. Springer, (2008)Vector Wirtinger-type inequality and the stability analysis of delayed neural network., , и . Commun. Nonlinear Sci. Numer. Simul., 18 (5): 1246-1257 (2013)The Phase Transition Analysis for the Random Regular Exact 2-(d, k)-SAT Problem., , , и . Symmetry, 13 (7): 1231 (2021)Maximum Renamable Horn and Maximum Independent Sets., и . CSIE (1), стр. 743-747. IEEE Computer Society, (2009)The Convergence of a Cooperation Markov Decision Process System., , и . Entropy, 22 (9): 955 (2020)Exploiting context for people detection in crowded scenes., и . J. Electronic Imaging, 27 (04): 043028 (2018)Exact satisfiability and phase transition analysis of the regular (k, d)-CNF formula., , , и . Frontiers Comput. Sci., 18 (1): 181405 (февраля 2024)The complexity of homomorphisms and renamings for minimal unsatisfiable formulas., и . Ann. Math. Artif. Intell., 43 (1): 113-127 (2005)Stable analysis for neural networks: Set-valued mapping method., , , и . Appl. Math. Comput., (2013)