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.

This is a fingerprint verification application. When verifying,it loops through the table. if the current fingerprint template is the first one on the table row it verifies it correctly. But ...

Why doesn't the code (2) below produce the same output as the code (1)? Let's say you entered "4" as input:

(1)

    int x;
    cout << "enter integer: ";
    cin ...

I want to edit the following code where I want

Convert the print from left to right
2 - Modify the contents of the print down the data grid ...