CrazyEngineers
CrazyEngineers

  • Doubt in Algorithm?

    sushant005

    Member

    Updated: Oct 25, 2024
    Views: 1.4K
    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?
    0
    Replies
Howdy guest!
Dear guest, you must be logged-in to participate on CrazyEngineers. We would love to have you as a member of our community. Consider creating an account or login.
Replies

  • mohammadfawaz

    Member • 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!
    Are you sure? This action cannot be undone.
    Cancel
Home Channels Search Login Register