Guillaume Malod

Available identifiers

Publication	Date of Publication	Type
Towards optimal depth-reductions for algebraic formulas	2024-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q5875648	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5232538	2019-09-12	Paper
Homomorphism Polynomials Complete for VP	2017-04-25	Paper
Lower bounds for non-commutative skew circuits	2016-11-01	Paper
Homomorphism polynomials complete for VP	2016-05-24	Paper
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication	2015-10-08	Paper
Monomials in arithmetic circuits: complete problems in the counting hierarchy	2015-07-08	Paper
Lower bounds for depth 4 formulas computing iterated matrix multiplication	2015-06-26	Paper
Separating multilinear branching programs and formulas	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	2011-08-19	Paper
Universal relations and {\#}P-completeness	2008-11-18	Paper
Circuits arithmétiques et calculs tensoriels	2008-11-13	Paper
Characterizing Valiant's algebraic complexity classes	2008-03-26	Paper
Characterizing Valiant’s Algebraic Complexity Classes	2007-09-05	Paper
Universal Relations and #P-Completeness	2007-05-02	Paper
Naming worlds in modal and temporal logic	2002-04-11	Paper

This page was built for person: Guillaume Malod