Journal article

Generalized hypertree decompositions: np-hardness and tractable variants.

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gottlob, G., Miklós, Z., & Schwentick, T. (2007). Generalized hypertree decompositions: np-hardness and tractable variants. PODS, 56(6), 13–22.

MLA Style

Gottlob, G., et al. “Generalized Hypertree Decompositions: Np-Hardness and Tractable Variants.” PODS, edited by L Libkin, vol. 56, no. 6, ACM, 2007, pp. 13–22.

Chicago Style

Gottlob, G, Z Miklós, and T Schwentick. 2007. “Generalized Hypertree Decompositions: Np-Hardness and Tractable Variants.” Edited by L Libkin. PODS 56 (6): 13–22.
Share
Print

Access Document

Publisher copy:: 10.1145/1265530.1265533

Authors

+ Gottlob, G More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

+ Miklós, Z More by this author

Role:: Author

+ Schwentick, T More by this author

Role:: Author

Contributors

Role:: Editor

Publisher:: ACM
Journal:: PODS More from this journal
Volume:: 56
Issue:: 6
Pages:: 13-22
Publication date:: 2007-01-01
DOI:: 10.1145/1265530.1265533
EISSN:: 1557-735X
ISSN:: 0004-5411

Language:: English
Keywords:: Conjunctive query

Tractable

Hypergraph

Hypertree decomposition

NP-complete

Acyclic

Treeprojection Problem
Pubs id:: pubs:296418
UUID:: uuid:1fe7857b-8380-4ce7-803c-dae5f29c558d
Local pid:: pubs:296418
Source identifiers:: 296418
Deposit date:: 2013-11-17

Terms of use

Copyright date:: 2007

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP