Back to Results
First PageMeta Content
Computational complexity theory / Complexity classes / Theory of computation / NP / P / Reduction / Time complexity


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:58


Open Document

File Size: 239,81 KB

Share Result on Facebook