Výsledky vyhledávání - "Fixed-parameter algorithms and complexity"

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

“…We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These polynomials have…”
Získat plný text