Algebraic complexity theory. III: On the complexity of the computation of permanents

MaRDI QIDQ1380698zbMATH OpenFDO

Authors Michael Clausen

Publication date 12 March 1998

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/119290, http://www.emis.de/journals/SLC/wpapers/s36clausen.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Determinants, permanents, traces, other special matrix functions (15A15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Completeness and reduction in algebraic complexity theory
• Feasible arithmetic computations: Valiant's hypothesis
• scientific article; zbMATH DE number 1375589
• scientific article; zbMATH DE number 1136078

Cited in

(6)

• Feasible arithmetic computations: Valiant's hypothesis
• Ulrich complexity
• scientific article; zbMATH DE number 5839812 (Why is no real title available?)
• Decision Versus Evaluation in Algebraic Complexity
• The Computational Complexity of Immanants
• Upper bounds on real roots and lower bounds for the permanent

This page was built for publication: Algebraic complexity theory. III: On the complexity of the computation of permanents

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380698)