Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

102

FOCM
2016

favoriteEmaildiscussreport

167views Automated Reasoning» more FOCM 2016»

Computing the Permanent of (Some) Complex Matrices

8 years 7 months ago

Computing the Permanent of (Some) Complex Matrices

Download www.math.lsa.umich.edu

Alexander I. Barvinok

Real-time Traffic

Automated Reasoning | FOCM 2016 |

claim paper

Related Content

» On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Mat...

» On the hardness of approximating the permanent of structured matrices

» On the Complexity of Matrix Rank and Rigidity

» The Permanent Requires Large Uniform Threshold Circuits

» On the Hardness of the Noncommutative Determinant

» The Complexity of the Inertia and Some Closure Properties of GapL

» Monotone complexity and the rank of matrices

» Some recent progress in exact linear algebra and related questions

» The Structure of Sparse Resultant Matrices

» What makes some POMDP problems easy to approximate

Post Info
More Details (n/a)

Added	03 Apr 2016
Updated	03 Apr 2016
Type	Journal
Year	2016
Where	FOCM
Authors	Alexander I. Barvinok

Comments (0)