Advertisement
Published in:
13-05-2022
Covert Factor’s Exploiting and Factor Planning
Published in: Annals of Data Science | Issue 3/2022
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
All the classification solutions in artificial intelligence can be summed up as explicit factor implicit problem, and the explicit factor implicit problem should be solved by linear programming. The simplex linear programming algorithm is simple and fast, but it is not a polynomial algorithm. Whether it can be improved into a “strong polynomial algorithm”, that is, in any case, the number of operations of this algorithm is a polynomial function of the number of equations and variables, is a trans-century international mathematical problem that has been unsolved for decades. This question, which involves the mathematical boundaries of ai development, is crucial. The method of solving programming problem from the demand and specialty of artificial intelligence is called factor programming. This paper will introduce the basic ideas of factor explicit and implicit programming and factor programming, and write programs for some of the algorithms, and prove the theorem of triangular matrix optimization.