Wikidata

(Q906584)

English

UP

complexity class of decision problems solvable in polynomial time on an unambiguous Turing machine with at most one accepting path for each input

  • unambiguous non-deterministic polynomial-time
In more languages
default for all languages
No label defined

No description defined

Statements

Identifiers

 
edit
edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  Retrieved from "https://www.wikidata.org/w/index.php?title=Q906584&oldid=2023235717"