Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Malod, Guillaume"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Homomorphism polynomials complete for VP
Arnaud Durand
,
Meena Mahajan
,
Guillaume Malod
,
Nicolas de Rugy-Altherre
,
Nitin Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 493-504
Separating multilinear branching programs and formulas
Zeev Dvir
,
Guillaume Malod
,
Sylvain Perifel
,
Amir Yehudayoff
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 615-624
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Hervé Fournier
,
Guillaume Malod
,
Stefan Mengel
Leibniz International Proceedings in Informatics (LIPIcs)
14
, 2012, pp. 362-373
Universal relations and \#P-completeness
Hervé Fournier
,
Guillaume Malod
Theoretical Computer Science
407
(1-3), 2008, pp. 97-109
Characterizing Valiant's algebraic complexity classes
Guillaume Malod
,
Natacha Portier
Journal of Complexity
24
(1), 2008, pp. 16-38
Universal relations and
\#P
-completeness
Hervé Fournier
,
Guillaume Malod
Lecture Notes in Computer Science
3998
, 2006, pp. 368-379
Characterizing Valiant's algebraic complexity classes
Guillaume Malod
,
Natacha Portier
Lecture Notes in Computer Science
4162
, 2006, pp. 704-716