Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Computing the permanent

Known as: Ryser's formula, Computation of the permanent of a matrix, Computation of the permananent of a matrix 
In linear algebra, the computation of the permanent of a matrix is a problem that is known to be more difficult than the computation of the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We present a deterministic algorithm, which, for any given $$0< \epsilon < 1$$0<ϵ<1 and an $$n \times n$$n×n real or complex… Expand
Highly Cited
2010
Highly Cited
2010
Both common intuition and findings from multiple areas of research suggest that when faced with distressing experiences, it is… Expand
Review
2006
Review
2006
THE AUTONOMIC COMPUTING PARADIGM Overview of Autonomic Computing: Origins, Evolution, Direction Alan Ganek A Requirements… Expand
Highly Cited
2006
Highly Cited
2006
Let p(x<sub>1</sub>,...,x<sub>n</sub>) = p(X) , X ∈ R<sup>n</sup> be a homogeneous polynomial of degree n in n real variables, e… Expand
Highly Cited
2004
Highly Cited
2004
We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative… Expand
  • figure 2
  • figure 4
  • figure 5
Highly Cited
2001
Highly Cited
2001
The Programming and Software Engineering Research Group of the Institute of Computer Science of the Ludwig-Maximilians University… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1992
Highly Cited
1992
Let G=(U, V, E) be a bipartite graph with |U|=|V|=n. The factor size of G, f, is the maximum number of edge disjoint perfect… Expand
Highly Cited
1989
Highly Cited
1989
A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of… Expand
Highly Cited
1988
Highly Cited
1988
We show that computing the volume of a polyhedron given either as a list of facets or as a list of vertices is as hard as… Expand
Highly Cited
1979
Highly Cited
1979
  • L. Valiant
  • Theor. Comput. Sci.
  • 1979
  • Corpus ID: 1637832
Abstract It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems… Expand
  • figure 1
  • figure 2
  • figure 3