The shortest common supersequence problem over binary alphabet is NP-complete

author
contributor
inLanguage
  • en
isPartOf
name
  • The shortest common supersequence problem over binary alphabet is NP-complete
P60049

Instances

The shortest common supersequence problem over binary alphabet is NP-complete

datePublished
  • 1979
description
  • kuvitettu
identifier
  • propertyID: FI-FENNI value: 69641
  • propertyID: FI-MELINDA value: 000642816
isbn
  • 9514517954
isPartOf
name
  • The shortest common supersequence problem over binary alphabet is NP-complete
numberOfPages
  • [2], 16 s.
P60048
P60050
publication
  • location: Hki organizer: Helsingin yliopisto
publisher

Download this resource as RDF: