A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties |
scientific article; zbMATH DE number 7564431
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties |
scientific article; zbMATH DE number 7564431 |
Statements
27 July 2022
0 references
fine-grained complexity
0 references
hardness in P
0 references
hyperclique conjecture
0 references
constrained triangle detection
0 references
0 references
0 references
0 references
0 references
0 references
A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (English)
0 references
