Monotone arithmetic complexity of graph homomorphism polynomials

DOI10.4230/LIPICS.ICALP.2022.83MaRDI QIDQ6560881zbMATH OpenFDO

Authors Balagopal Komarath, Anurag Pandey, Chengot Sankaramenon Rahul

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.83

zbMATH Keywords

algebraic branching programsalgebraic circuitsalgebraic complexityalgebraic formulasfine-grained complexityfixed-parameter algorithms and complexitygraph algorithmsgraph homomorphismshomomorphism polynomialsmonotone complexitypathwidthtreedepthtreewidth

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Monotone arithmetic complexity of graph homomorphism polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560881)