P stands for polynomial time. NP stands for non-deterministic polynomial time. Definitions: Polynomial time means that the complexity of the algorithm is O(n^k), where n is the size of your data (e. g. number of elements in a list to be sorted), and k is a constant.

Now, a German man named Norbert Blum has claimed to have solved the above riddle, which is properly known as the P vs NP problem.

3 0

3 years ago

Read 2 more answers

so just say what benchmark 1 1/8 is closet to (ps benchmarks on the side) and do the same for 2 2/5 . and the benchmarks that yo

liq [111]

Answer:

ok.

what benchmark 1 1/8 is closet to (ps benchmarks on the side) and do the same for 2 2/5 . and the benchmarks that you found subtract them.

lol sorry though I don't know sorry

Step-by-step explanation:

5 0