Monotone bounded-depth formula size for graph homomorphism polynomials equals n^{λ_Δ(H)}, where λ_Δ(H) is the minimum cost of a baggy elimination tree of product depth Δ.
Robustly Sepa- rating the Arithmetic Monotone Hierarchy via Graph Inner-Product
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monotone Bounded Depth Formula Complexity of Graph Homomorphism Polynomials
Monotone bounded-depth formula size for graph homomorphism polynomials equals n^{λ_Δ(H)}, where λ_Δ(H) is the minimum cost of a baggy elimination tree of product depth Δ.