Pseudo Polynomial Reduction Of Problems And Strong Np-Hard Problems
Keywords:
Abstract
This scientific article is devoted to the study of complexity theory for solving artificial intelligence (AI) problems and the classification of problems according to NP completeness. is similar to NP-complexity generation methods for boundary programming problems. It is wiser and more efficient to look for sufficiently accurate prediction algorithms than to find evidence that the problem in question belongs to the NP class and therefore wastes time. This scientific article provides a typical example that illustrates all algorithms.
Similar Articles
-
Analysis Of The Range Of Modern Women's Coats
The American Journal of Engineering and Technology: No. 09 (2021) / Tursunova X.Sh., Nizamova B.B. , Mamatqulova S.R., -
Calculation Of High Harmonics Produced By The Saturation Of A Magnetic Core Of A Current Transformer
The American Journal of Engineering and Technology: No. 01 (2021) / Sultan Fayzullayevich Amirov , Shavkat Mukhsimov , Otabek Tashmuhammatovich Boltayev, -
Reliability Of An Automatic Adjustable Current Transformer
The American Journal of Engineering and Technology: No. 01 (2021) / Mukhsimov Sh.S., -
JUSTIFICATION OF THE SLIDING CUTTING ANGLE OF THE KNIFE OF THE MOWER-BUCKER KPP- 3.0
The American Journal of Engineering and Technology: No. 08 (2023) / Salavat Askhatovich Khaziev, -
Creating A New Range Of Boots For Young Children
The American Journal of Engineering and Technology: No. 06 (2021) / Nizom Adashaliyevich Ismatullayev , Abrorjon Olimjon Ugli Homidjonov , Muhayyo Ibrohimjon Qizi Tohirova, -
DIELECTRIC PROPERTIES OF MICRO-COMPOSITES BASED ON ACRYLIC COATED CONDUCTING CARBON PARTICLES AND SILICONE ELASTOMER
The American Journal of Engineering and Technology: No. 07 (2023) / Vishal Mishra, -
Comparative Analysis Of Elongation Deformations Of Mixed Yarns In The New Range
The American Journal of Engineering and Technology: No. 09 (2020) / Zokhidjon Juraboevich Atamirzaev, -
Surface Pre-Treatment Of Clump Stirred Parts For Adhesively Fortified Congregations
-
New Range Of Raw Silk Twisted Threads
The American Journal of Engineering and Technology: No. 11 (2020) / Khalima Alimovna Alimova, Khalima Khabibullaevna Umurzakova, Jakhonjir Adxamovich Akhmedov, Dilafruz Uktamovna Aripdjanova, Jurabek Shomil Ogli Sharipov, -
ASSESSMENT OF TENSION AND IMPACT HAZARD FOR UNDERGROUND MINING AND A SET OF DATA BY ACOUSTIC EMISSION WITH THE SB-32 DEVICE
The American Journal of Engineering and Technology: No. 05 (2022) / Z.S. Nazarov, A.O. Choriqulov,
References
Gary M., Johnson D. "Computing machines and intractable problems". M .: Mir 1982-466 pp.
Ivanova A.P. “Introduction to Applied Programming. Models and Computational Algorithms”. M .: Fizmatlit 2002
Perepelitsa V.A. “Asymptotic approach and solution of some extremal problems on graphs. Problems of Cybernetics "M .: Nauka, 1973
A.V. Yakovlev, A.A. Bezbogov, V.V. Rodin, V. N. Shamkin, CRYPTOGRAPHIC PROTECTION OF INFORMATION
Eremeev A.V., Romanova A.A., Servakh V.V., Chaukhan S.S. Approximate solution of one problem of supply management // Diskretn. analysis and issled. operations. Series 2. 2006. T. 13, No. 1. P. 27–39.
Кодиров Э. С. У., Халилов З. Ш. ВЗАИМОСВЯЗИ И РАЗЛИЧИЯ МЕЖДУ “DEEP LEARNING” И “MACHINE LEARNING” //Universum: технические науки. – 2020. – №. 7-1 (76).
Кодиров Э. С. У., Халилов З. Ш. ВОЗМОЖНОСТИ И ПРЕИМУЩЕСТВА ИСКУССТВЕННОГО ИНТЕЛЛЕКТА (ИИ) И ЛОГИЧЕСКИХ ВЫЧИСЛЕНИЙ //Universum: технические науки. – 2020. – №. 6-1 (75).
Karimov U. et al. USING NEW INFORMATION TECHNOLOGIES IN DISTANCE LEARNING SYSTEM //НОВАЯ ПРОМЫШЛЕННАЯ РЕВОЛЮЦИЯ В ЗЕРКАЛЕ СОВРЕМЕННОЙ НАУКИ. – 2018. – С. 9-11.
R.Khamdamov, U.Begimkulov, N.Taylokov. Information technology in education. Tashkent, 2010.
