HELP!! HARDEST QUESTION EVER WILL MARK BRAINLIEST!

Question

HELP!! HARDEST QUESTION EVER WILL MARK BRAINLIEST!

in progress 0
Luna 3 months 2022-02-15T18:33:49+00:00 2 Answers 0 views 0

Answers ( )

    0
    2022-02-15T18:35:02+00:00

    Answer:

    P versus NP

    Step-by-step explanation:

    The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly. … The class of questions for which an answer can be verified in polynomial time is called NP, which stands for “nondeterministic polynomial time”

    0
    2022-02-15T18:35:39+00:00

    Question

    Step-by-step explanation:

Leave an answer

45:7+7-4:2-5:5*4+35:2 =? ( )