Total Pageviews

Monday, November 17, 2014

The NP-COMPLETE subset sum problem solved as a matrix multiplication

The columns of the matrix are the integers in binary form, but you can generate this matrix recursively in O(n), the real complexity it’s the matrix multiplication.

Friday, November 7, 2014

UNT Algorithm for solving NP-Complete SSP on a single step

Added an UNT <"algorithm"> that solves the NP-Complete Subset Sum Problem on a single step.

Universal Number Theory Algorithm for the NP-Complete Sum Subset Problem on Classical Turing Machine 

Wednesday, October 29, 2014

Massive and Parallel Programming with UNT

Hi all, I want to present my work, it's hard to explain, but here I attached an example of a typical CUDA, but my "Universal Number Theory", the theory itself is quite extensive even the am writing, but more importantly, solves the problem of P vs NP, I invite you to review my work, thanks.