A negative conjunctive query is easy if and only if it is beta-acyclic (Q4649543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6109830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A negative conjunctive query is easy if and only if it is beta-acyclic |
scientific article; zbMATH DE number 6109830 |
Statements
22 November 2012
0 references
conjunctive query
0 references
hypergraph
0 references
beta-acyclicity
0 references
data complexity
0 references
Davis-Putnam procedure
0 references
0.7763333320617676
0 references
0.7755386829376221
0 references
0.7718681693077087
0 references
0.7629659175872803
0 references
0.7520365118980408
0 references
