A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.CCC.2019.31 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.CCC.2019.31 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 30 December 2024
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
