Algebraic complexity theory. III: On the complexity of the computation of permanents. (Algebraische Komplexitätstheorie. III: Zur Berechnungskomplexität von Permanenten.)
Clausen, Michael
Séminaire Lotharingien de Combinatoire [electronic only], Tome 36 (1996), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1996-01-01
EUDML-ID : urn:eudml:doc:119290 
@article{01127108,
     title = {Algebraic complexity theory. III: On the complexity of the computation of permanents. (Algebraische Komplexit\"atstheorie. III: Zur Berechnungskomplexit\"at von Permanenten.)},
     journal = {S\'eminaire Lotharingien de Combinatoire [electronic only]},
     volume = {36},
     year = {1996},
     zbl = {0885.68067},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01127108}
}

Clausen, Michael. Algebraic complexity theory. III: On the complexity of the computation of permanents. (Algebraische Komplexitätstheorie. III: Zur Berechnungskomplexität von Permanenten.). Séminaire Lotharingien de Combinatoire [electronic only], Tome 36 (1996) . http://gdmltest.u-ga.fr/item/01127108/