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 ?
ithelp
757
Posting Virtuoso
Banned
Recommended Answers
Jump to PostIt is the input.
This question has nothing to do with C++. It belongs in the Computer Science forum (which includes Theory of Computation).
All 2 Replies
farag
-3
Junior Poster in Training
what is N ??
Duoas
1,025
Postaholic
Featured Poster
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.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.