MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An efficient tree decomposition method for permanents and mixed discriminants

Author(s)
Cifuentes, Diego Fernando; Parrilo, Pablo A
Thumbnail
DownloadParrilo_An efficient.pdf (607.0Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution-NonCommercial-NoDerivs License http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
Abstract
We present an efficient algorithm to compute permanents, mixed discriminants and hyperdeterminants of structured matrices and multidimensional arrays (tensors). We describe the sparsity structure of an array in terms of a graph, and we assume that its treewidth, denoted as ω, is small. Our algorithm requires Õ(n2[superscript ω]) arithmetic operations to compute permanents, and Õ(n[superscript 2] + n3[superscript ω]) for mixed discriminants and hyperdeterminants. We finally show that mixed volume computation continues to be hard under bounded treewidth assumptions. Keywords: Permanent; Structured array; Mixed discriminant; Treewidth; Hyperdeterminant
Date issued
2015-12
URI
http://hdl.handle.net/1721.1/114872
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Linear Algebra and its Applications
Publisher
Elsevier
Citation
Cifuentes, Diego, and Pablo A. Parrilo. “An Efficient Tree Decomposition Method for Permanents and Mixed Discriminants.” Linear Algebra and Its Applications 493 (March 2016): 45–81 © 2015 Elsevier
Version: Original manuscript
ISSN
0024-3795

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.