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.
2016
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
Is this relevant?
Highly Cited
2010
Highly Cited
2010
• 2010
• Corpus ID: 16570068
Both common intuition and findings from multiple areas of research suggest that when faced with distressing experiences, it is… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• JACM
• 2004
• Corpus ID: 47361920
We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• CONCUR
• 2004
• Corpus ID: 1324353
One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
• 2003
• Corpus ID: 13845412
How do rational firms respond to consumer biases? In this paper we analyze the profit-maximizing contract design of firms if… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
• CAV
• 1999
• Corpus ID: 8987497
One of the major problems in applying automatic verification tools to industrial-size systems is the excessive amount of memory… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
• SIAM J. Comput.
• 1989
• Corpus ID: 2986685
A randomised approximation scheme for the permanent of a 0–1s presented. The task of estimating a permanent is reduced to that of… Expand
Is this relevant?
Highly Cited
1988
Highly Cited
1988
• SIAM J. Comput.
• 1988
• Corpus ID: 35165656
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
Is this relevant?
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
Is this relevant?