Institutional Repository

Browsing Department of Decision Sciences by Subject "NP-completeness"

Browsing Department of Decision Sciences by Subject "NP-completeness"

Sort by: Order: Results:

  • Sauer, Paul Van der Merwe (2019-12)
    The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. The word α over a finite set A is said to be unavoidable for an infinite set B+ of nonempty words over a finite ...

Search UnisaIR


Browse

My Account