Doubt in Algorithm?

sushant005
sushant005
@sushant005-tyt4WK • Oct 25, 2024

Hi friends,

We know that class P problem belongs to class of decision problem and can be solved in polynomial time on a deterministic computation model where as class NP problem is also belongs to the class of decision proble and can be solved in polynomial time by a non- deterministic computation model.

Can any one please explain what is meant by deterministic model of computation?

Like 0 Replies 1

Replies

Welcome, guest

Join CrazyEngineers to reply, ask questions, and participate in conversations.

Sign up Log in

CrazyEngineers powered by Jatra Community Platform

  • mohammadfawaz
    mohammadfawaz

    @mohammadfawaz-NPvfDD • Jul 4, 2010

    I think it means that you can't find a simple formula for it's complexity. That is, you can't find an expression like O(n) or O(log n) for these problems. NP problems have this characteristic!

    0