P (Q846354)

From Wikidata
Jump to: navigation, search
Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time.
  • P class
  • PTIME
edit
Language Label Description Also known as
English
P
Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time.
  • P class
  • PTIME

Statements

0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit