• Title of article

    The Approximate Period Problem

  • Author/Authors

    Vladimir Yu. Popov، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    7
  • From page
    1
  • To page
    7
  • Abstract
    We show that the approximate period problem is NP-complete for metric and alphabet cardinality 7.
  • Keywords
    approximate periods , computational complexity
  • Journal title
    IAENG International Journal of Computer Science
  • Serial Year
    2009
  • Journal title
    IAENG International Journal of Computer Science
  • Record number

    675375

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=675375