Data Structures and Algorithms

1505 Submissions

[2] viXra:1505.0218 [pdf] submitted on 2015-05-29 01:56:46

P vs NP. the Most Effective Algorithm for the Hamilton Problem.

Authors: Grzegorz Ileczko
Comments: 14 Pages.

This arcle is a short demonstraon of computaonal possibilies of the extreme effecve algorithm for the Hamilton problem. In fact, the algorithm can fast solve a few similar problems, well-known in literature as: Hamilton path Hamilton cycle and Hamilton longest path Hamilton longest cycle
Category: Data Structures and Algorithms

[1] viXra:1505.0169 [pdf] submitted on 2015-05-23 18:53:26

Integer Factorization is in P

Authors: Yuly Shipilevsky
Comments: 10 Pages.

A polynomial-time algorithm for integer factorization, wherein integer factOrization reduced to a convex polynomial-time integer minimization problem.
Category: Data Structures and Algorithms