(Q628036)

English

NP

computational complexity class of decision problems solvable by a non-deterministic Turing machine in polynomial time

  • NP class
  • nondeterministic polynomial
  • nondeterministic polynomial time
  • nondeterministic polynomial complexity class
  • non-deterministic polynomial
In more languages
default for all languages
No label defined

No description defined

Statements

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit