Ask Your Question
0

What is the complexity of the algorithm for an NP problem?

asked 2021-12-16 11:00:00 +0000

lakamha gravatar image

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted
2

answered 2022-02-02 06:00:00 +0000

bukephalos gravatar image

The complexity of an algorithm for an NP problem is typically exponential. This means that the time required to solve the problem grows exponentially with the size of the input. However, there are some algorithms that can solve certain NP problems in polynomial time, but they are not known for most problems in the NP class.

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account. This space is reserved only for answers. If you would like to engage in a discussion, please instead post a comment under the question or an answer that you would like to discuss

Add Answer


Question Tools

Stats

Asked: 2021-12-16 11:00:00 +0000

Seen: 19 times

Last updated: Feb 02 '22