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

City

Stuttgart / /

Company

X5 / /

/

Facility

Yes I NTE RNAT I ONA L Institute of Mathematics / Stuttgart University / /

IndustryTerm

polynomial algorithm / parallel algorithm / internet log files / /

OperatingSystem

Xp / /

Organization

Institute of Mathematics / Stuttgart University / /

Person

Markus Lohrey Querying / Markus Lohrey / Yury Lifshits / Subsequence Matching / /

Technology

parallel algorithm / Compressed Text Why algorithms / polynomial algorithm / /

URL

http /

SocialTag