Stop the war!
Остановите войну!
for scientists:
default search action
"The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete."
Kari-Jouko Räihä, Esko Ukkonen (1981)
- Kari-Jouko Räihä, Esko Ukkonen:
The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. Theor. Comput. Sci. 16: 187-198 (1981)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.