Guillaume Malod

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Towards optimal depth-reductions for algebraic formulas	2024-11-19	Paper
scientific article; zbMATH DE number 7650312 (Why is no real title available?)	2023-02-03	Paper
Non-commutative computations: lower bounds and polynomial identity testing Chicago Journal of Theoretical Computer Science	2019-09-12	Paper
Homomorphism polynomials complete for VP	2017-04-25	Paper
Lower bounds for non-commutative skew circuits Theory of Computing	2016-11-01	Paper
Homomorphism polynomials complete for VP Chicago Journal of Theoretical Computer Science	2016-05-24	Paper
Lower bounds for depth-4 formulas computing iterated matrix multiplication SIAM Journal on Computing	2015-10-08	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy Computational Complexity	2015-07-08	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy Computational Complexity	2015-07-08	Paper
Lower bounds for depth 4 formulas computing iterated matrix multiplication Proceedings of the forty-sixth annual ACM symposium on Theory of computing	2015-06-26	Paper
Separating multilinear branching programs and formulas Proceedings of the forty-fourth annual ACM symposium on Theory of computing	2014-05-13	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy	2012-08-23	Paper
Succinct algebraic branching programs characterizing non-uniform complexity classes Fundamentals of Computation Theory	2011-08-19	Paper
Universal relations and {\#}P-completeness Theoretical Computer Science	2008-11-18	Paper
Circuits arithmétiques et calculs tensoriels Journal of the Institute of Mathematics of Jussieu	2008-11-13	Paper
Characterizing Valiant's algebraic complexity classes Journal of Complexity	2008-03-26	Paper
Characterizing Valiant’s Algebraic Complexity Classes Lecture Notes in Computer Science	2007-09-05	Paper
Universal Relations and #P-Completeness Lecture Notes in Computer Science	2007-05-02	Paper
Naming worlds in modal and temporal logic Journal of Logic, Language and Information	2002-04-11	Paper

Research outcomes over time

This page was built for person: Guillaume Malod