Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
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… 
Review
2007
Review
2007
Programmed cell death (PCD) is a finely tuned process of multicellular organisms. In higher plants, PCD regulates many… 
Review
2006
Review
2006
THE AUTONOMIC COMPUTING PARADIGM Overview of Autonomic Computing: Origins, Evolution, Direction Alan Ganek A Requirements… 
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… 
Highly Cited
2004
Highly Cited
2004
One obtains in this paper a process algebra RCCS, in the style of CCS, where processes can backtrack. Backtrack, just as plain… 
Highly Cited
1999
Highly Cited
1999
One of the major problems in applying automatic verification tools to industrial-size systems is the excessive amount of memory… 
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… 
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… 
Highly Cited
1979
Highly Cited
1979
  • L. Valiant
  • Theor. Comput. Sci.
  • 1979
  • Corpus ID: 1637832