×
+ All Categories
Log in
English
Français
Español
Deutsch
Report -
Generalized Hypertree Decompositions: NP-Hardness and … · 2007. 3. 21. · queries whose M-width is bounded by a constant. – Polynomial Recognizability. For each constant k,
Name
Email
Select
Select
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Message
Please pass captcha verification before submit form