The Complexity of Approximately Counting Tree Homomorphisms (Q2943573): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105782517 / rank
 
Normal rank

Revision as of 01:06, 20 March 2024

scientific article
Language Label Description Also known as
English
The Complexity of Approximately Counting Tree Homomorphisms
scientific article

    Statements

    The Complexity of Approximately Counting Tree Homomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity classes
    0 references
    counting problems
    0 references
    graph homomorphisms
    0 references
    reducibility
    0 references
    0 references