Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{amano:LIPIcs.ISAAC.2022.29, author = {Amano, Kazuyuki}, title = {{Integer Complexity and Mixed BinaryTernary Representation}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {29:129:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772587}, ISSN = {18688969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17314}, URN = {urn:nbn:de:0030drops173146}, doi = {10.4230/LIPIcs.ISAAC.2022.29}, annote = {Keywords: Integer complexity, Lower bounds, Upper bounds, Horner’s schema, Computer assisted proof} }
Keywords:  Integer complexity, Lower bounds, Upper bounds, Horner’s schema, Computer assisted proof  
Collection:  33rd International Symposium on Algorithms and Computation (ISAAC 2022)  
Issue Date:  2022  
Date of publication:  14.12.2022  
Supplementary Material:  Dataset: https://gitlab.com/KazAmano/integercomplexity archived at: https://archive.softwareheritage.org/swh:1:dir:e76eb9f674cdd675ba9a9aaf112f11934e7d23f6 