Go to the corresponding LIPIcs Volume Portal 
Arvind, Vikraman ; Joglekar, Pushkar S.
pdfformat: 

@InProceedings{arvind_et_al:LIPIcs.CCC.2022.12, author = {Arvind, Vikraman and Joglekar, Pushkar S.}, title = {{On Efficient Noncommutative Polynomial Factorization via Higman Linearization}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {12:112:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772419}, ISSN = {18688969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16574}, URN = {urn:nbn:de:0030drops165747}, doi = {10.4230/LIPIcs.CCC.2022.12}, annote = {Keywords: Noncommutative Polynomials, Arithmetic Circuits, Factorization, Identity testing} }
Keywords:  Noncommutative Polynomials, Arithmetic Circuits, Factorization, Identity testing  
Collection:  37th Computational Complexity Conference (CCC 2022)  
Issue Date:  2022  
Date of publication:  11.07.2022 