Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1706.08414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Möbius functions of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A second threshold for the hard‐core model on a Bethe lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms by Fibonacci gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Matchings of Size k Is $\sharp$ W[1]-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms are a good basis for counting small subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting homomorphisms seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation trichotomy for Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally constrained graph homomorphisms -- structure, complexity, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Unlabelled Subtrees of a Tree is #P-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of <i>k</i>-B<scp>iclique</scp> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms of derivative graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the foundations of combinatorial theory I. Theory of M�bius Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3748279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of counting problems on 3-regular planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2673671271 / rank
 
Normal rank
Property / title
 
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (English)
Property / title: Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (English) / rank
 
Normal rank

Latest revision as of 09:01, 30 July 2024

scientific article; zbMATH DE number 7205041
Language Label Description Also known as
English
Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
scientific article; zbMATH DE number 7205041

    Statements

    0 references
    27 May 2020
    0 references
    homomorphisms
    0 references
    matroids
    0 references
    counting complexity
    0 references
    parameterized complexity
    0 references
    dichotomy theorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (English)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references