Computing Sparse Permanents Faster

Information Processing Letters - Netherlands
doi 10.1016/j.ipl.2005.06.007
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

Faster Explicit Formulas for Computing Pairings Over Ordinary Curves

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Evaluation of Permanents

Proceedings of the Edinburgh Mathematical Society
Mathematics
1979English

Book Review: Permanents

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1979English

Approximating Permanents and Hafnians

Discrete Analysis
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2017English

On the Evaluation of Permanents

Pacific Journal of Mathematics
Mathematics
1982English

Planarity, Determinants, Permanents, and (Unique) Matchings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Computing the Moments of the Complex Gaussian: Full and Sparse Covariance Matrix

Mathematics
Mathematics
2019English

An Inequality of Hadamard Type for Permanents

Methods and Applications of Analysis
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy