Go to the corresponding LIPIcs Volume Portal 
Komarath, Balagopal ; Pandey, Anurag ; Rahul, Chengot Sankaramenon
pdfformat: 

@InProceedings{komarath_et_al:LIPIcs.ICALP.2022.83, author = {Komarath, Balagopal and Pandey, Anurag and Rahul, Chengot Sankaramenon}, title = {{Monotone Arithmetic Complexity of Graph Homomorphism Polynomials}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {83:183:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772358}, ISSN = {18688969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16424}, URN = {urn:nbn:de:0030drops164245}, doi = {10.4230/LIPIcs.ICALP.2022.83}, annote = {Keywords: Homomorphism polynomials, Monotone complexity, Algebraic complexity, Graph algorithms, Finegrained complexity, Fixedparameter algorithms and complexity, Treewidth, Pathwidth, Treedepth, Graph homomorphisms, Algebraic circuits, Algebraic branching programs, Algebraic formulas} }
Keywords:  Homomorphism polynomials, Monotone complexity, Algebraic complexity, Graph algorithms, Finegrained complexity, Fixedparameter algorithms and complexity, Treewidth, Pathwidth, Treedepth, Graph homomorphisms, Algebraic circuits, Algebraic branching programs, Algebraic formulas  
Collection:  49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)  
Issue Date:  2022  
Date of publication:  28.06.2022 