which accepts an integer of arbitary length as an input and takes maximum polynomial time to execute , let us define a language L= {n | P does not crash for any input of size n}
How is easy or difficult to prove that L belongs to NP ?
0
Given a C++ program say P
0
Duoas 1,025 It is the input.
This question has nothing to do with C++. It belongs in the Computer Science forum (which includes Theory of Computation).
You might want to read up on NP complexity at Wikipedia.
Are you able to help answer this sponsored question?
Questions asked by members who have earned a lot of community kudos are featured in order to give back and encourage quality replies.
This topic has been dead for over six months. Start a new discussion instead.
Recommended Topics
