Hypertree decompositions and tractable queries (Q696962): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q59259717, #quickstatements; #temporary_batch_1722203565125
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcss.2001.1809 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033325972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Desirability of Acyclic Database Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power of Natural Semijoins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction from a deductive viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplied universal relation assumption and its properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for backtrack-bounded search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing LOGCFL certificates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardest Context-Free Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing constraint satisfaction problems using database techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity theory based on Boolean algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Determining Tree Query Membership Of A Distributed Query / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59259717 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:54, 28 July 2024

scientific article
Language Label Description Also known as
English
Hypertree decompositions and tractable queries
scientific article

    Statements

    Hypertree decompositions and tractable queries (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2002
    0 references
    decision problems on conjunctive queries
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers