Create an account to leave a comment.
Already have an account?
I was wondering if anyone can help me.
Since, I'm not smart and I don't know a lot it probably is logically fallacious.
Anyway, I need to find an unknown factorial. This factorial is suppose to be our quickest (polynomial time) solution to our "non-polynomial check."
To illustrate I need to be able to find the closest string of text in a "superstring."
The formula Z is defined as
L= length of string in character amount
X= how many strings altogether.
D= hamming distance.
Here's an example of Hamming distance.
We can see that the bold characters are the hamming distance. Which is 3 characters.
The algorithm is listed numerically so that it can be easy to follow.
1 Z = X * X * 1 * L + X * D * D * D2 S=Z/D3 B=S/D4 Y=S/B5 CL = D * A ≤ X ≤ B * Y6 P=B*Y7 B!=P
Suppose we need to find which permutation to select as our closest string. A permutation of 3 characters in a 7 letter word as aforementioned.
Assuming that all possible permutations are used then we select the 107th permutation word.
In other words, lets say we need to find any factorial of P=B*Y. Therefore, we will give any example of using the algorithm
d=3 hamming distance
If we plug in the variables we will get B=107 and P=323
So we have 107th permutated string to be the shortest? I'm probably wrong, and was hoping if anyone can tell me.
Explanation of b!=p
Here b! is 107 * y which is the quickest factorial to arrive at p. So does P equal possible permutations out of 107 characters? (eg. out of 323 permutations)
To explain what I'm trying to say is that there is a superstring of 323 characters. Within the hamming distance, the 107th permutation should be the closest to the center.
Are you sure? yes | no
© 2019 Hackaday