# Computing the permanent

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Foundations of Computational Mathematics
- 2016

We present a deterministic algorithm, which, for any given 0 < < 1 and an n × n real or complex matrix A = (aij) such that |aij… (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- SIAM J. Comput.
- 2006

We present an improved "cooling schedule" for simulated annealing algorithms for combinatorial counting problems. Under our new… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- J. ACM
- 2004

We present a polynomial-time randomized algorithm for estimating the permanent of an arbitrary n × n matrix with nonnegative… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- 2003

How do rational firms respond to consumer biases? In this paper, we analyze the profitmaximizing contract design of firms if… (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- 2002

rophic factor deprivation (TFD)-induced apoptosis in sympathetic neurons requires macromolecular synthesis–dependent BAX… (More)

Is this relevant?

2002

2002

- 2002

Motivation. Novel carbon allotropes, with finite molecular structure, including spherical fullerenes are nowadays currently… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- STOC
- 2000

We present a fully-polynomial randomized approximation scheme for computing the permanent of an arbitrary matrix with non… (More)

Is this relevant?

1992

1992

- computational complexity
- 1992

We study the complexity of computing the permanent on random inputs. We consider matrices drawn randomly from the space of n by n… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- SIAM J. Comput.
- 1989

A randomised approximation scheme for the permanent of a 0-1 matrix is presented. The task of estimating a permanent is reduced… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Theor. Comput. Sci.
- 1979

where the summation is over the n! permutations of (1,2, . . . , n). It is the same as the determinant except that all the terms… (More)

Is this relevant?