pdfformat: 

@InProceedings{arvind_et_al:LIPIcs:2017:8069, author = {Vikraman Arvind and Rajit Datta and Partha Mukhopadhyay and S. Raja}, title = {{Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings}}, booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)}, pages = {38:138:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770460}, ISSN = {18688969}, year = {2017}, volume = {83}, editor = {Kim G. Larsen and Hans L. Bodlaender and JeanFrancois Raskin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8069}, URN = {urn:nbn:de:0030drops80690}, doi = {10.4230/LIPIcs.MFCS.2017.38}, annote = {Keywords: Circuits, Nonassociative, Noncommutative, Polynomial Identity Testing, Factorization} }
Keywords:  Circuits, Nonassociative, Noncommutative, Polynomial Identity Testing, Factorization  
Seminar:  42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  
Issue date:  2017  
Date of publication:  2017 