Tree-Depth and the Formula Complexity of Subgraph Isomorphism (Q5885602): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-subgraph isomorphism on \(\text{AC}^{0}\) circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Tight(er) Bounds for the Excluded Grid Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Graph Homomorphism and Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Excluded-Minor Approximation of Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the $AC^0$ Complexity of Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beating treewidth for average-case subgraph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism preservation theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4638077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulas versus Circuits for Small Distance Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:32, 31 July 2024

scientific article; zbMATH DE number 7672230
Language Label Description Also known as
English
Tree-Depth and the Formula Complexity of Subgraph Isomorphism
scientific article; zbMATH DE number 7672230

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references