Search Results - "Fixed-parameter algorithms AND complexity*"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    Cover Image

    Monotone Arithmetic Complexity of Graph Homomorphism Polynomials by Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

    ISSN: 0178-4617, 1432-0541
    Published: New York Springer US 01.09.2023
    Published in Algorithmica (01.09.2023)
    “…We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These polynomials have…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: