Data Structures and Algorithms

1412 Submissions

[2] viXra:1412.0176 [pdf] submitted on 2014-12-15 05:33:53

General Solution of the Problem of Class (P Vs. NP).

Authors: Grzegorz Ileczko
Comments: 13 Pages.

This article demonstrates a general solution for the problems of class (P vs.NP). Peculiarly for the problems of class (P=NP). Presented solution is quite simple and can be applicable in many various areas of science. At general, (P=NP) it’s a class of problems which possess algorithmic nature. The algorithms should contains one or more of logical operations like (if...then) instruction, or Boolean operations. The proper proof for this thesis with a new formula was presented. Except formula, one proper example was presented for the problem (P=NP). Exists a lot of problems for which P class problems are equivalent with the NP problems (P=NP). Millions, I think. For example, I discovered extremely effective algorithm for the “Hamiltonian Path Problem”. Algorithm can find the proper solution for 100 cities at very short time. Solution time for old laptop is less than two seconds. Classical solution for that problem exists, but is extremely difficult and computer’s time is huge. Algorithm for the Hamilton problem, will be presented at separate article (needs more paper).
Category: Data Structures and Algorithms

[1] viXra:1412.0106 [pdf] submitted on 2014-12-03 19:14:19

A Method of Compression Through Variability Exploitation and Bit Substitution

Authors: Sidharth Ghoshal
Comments: 2 Pages. Copyright Sidharth Ghoshal

A high performance file compression algorithm
Category: Data Structures and Algorithms