Back to Results
First PageMeta Content
Complexity classes / NP-hardness / NP / P versus NP problem / Computational complexity theory / P / Reduction


What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2
Add to Reading List

Document Date: 2009-07-03 08:56:55


Open Document

File Size: 907,65 KB

Share Result on Facebook