The Complexity of Computing the Permanent

@article{Valiant1979TheCO,
  title={The Complexity of Computing the Permanent},
  author={L. Valiant},
  journal={Theor. Comput. Sci.},
  year={1979},
  volume={8},
  pages={189-201}
}
  • L. Valiant
  • Published 1979
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
Abstract It is shown that the permanent function of (0, 1)-matrices is a complete problem for the class of counting problems associated with nondeterministic polynomial time computations. Related counting problems are also considered. The reductions used are characterized by their nontrivial use of arithmetic. 
A Note on the Permanent Value Problem
On the computational complexity of the order polynomial
The power of counting
  • U. Schöning
  • Mathematics, Computer Science
  • [1988] Proceedings. Structure in Complexity Theory Third Annual Conference
  • 1988
On the parameterized complexity of approximate counting
  • J. Montoya
  • Mathematics, Computer Science
  • RAIRO Theor. Informatics Appl.
  • 2011
On the Power of Parity Polynomial Time
The Complexities of the Coefficients of the Tutte Polynomial
  • J. Annan
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1995
Probabilistic Complexity Classes 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1979
The complexity of theorem-proving procedures
  • S. Cook
  • Computer Science, Mathematics
  • STOC
  • 1971
A Lower Bound on the Number of Additions in Monotone Computations
  • C. Schnorr
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 1976
Every Prime has a Succinct Certificate
  • V. Pratt
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1975
Computational complexity of probabilistic Turing machines
The Polynomial-Time Hierarchy
  • L. Stockmeyer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1976
...
1
2
3
4
...