Given a C++ program say P

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 ?

c++

Contributors

Replies

Views

9 Years

Discussion Span

9 Years Ago

Last Post by Duoas

what is N ??

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.

c++

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.

Hello, I work at the U.S. Department of Labor. I am a maintenance prorgrammer of C code, and the configuration management of this code in the past has been very ...

Please I have an autocomplete textbox which fetches value from a tabe in the database. But after i choose the name i want to get the id of the value ...

Hello eveyone,

Please tell me why triangle shape is redrawing on mouse move. It want triangle shape draw only once until mouse release.

Here is my code below. Thank you ...