Back to Results
First PageMeta Content
Mathematics / Compressed pattern matching / NP-hard / NP / Yuri Matiyasevich / Embedding problem / Theoretical computer science / Complexity classes / Applied mathematics


Subsequence Matching (Embedding) Querying and Embedding Compressed Texts INPUT: pattern TEAM and text I N T E R N A T I ON A L S YMP O S I UM
Add to Reading List

Document Date: 2006-08-27 15:04:00

Open Document

File Size: 133,18 KB

Share Result on Facebook
UPDATE