Two New Computational Complexıty Algorithms

The purpose of this paper is to introduce two previously unknown algorythms that may be used to ease computational complexity problems. The former is an algorythm for solving x in a linear polynomial equation consisting of plus (+) signs only whereas the latter is an algorythm for finding out how many different ways in total are possible for any given points assuming that each point has a distance connecting one point to another.The methods include computational relationship establishment to discover the algortyhms. It is expected that this study will contribute to easing the potential solution of hard computational complexity problems. Keywords: equation, maths, prime, solution, algorithm, x, polynomial, degree