Counting Problems Computationally Equivalent to Computing the Determinant

@inproceedings{Toda1991CountingPC,
  title={Counting Problems Computationally Equivalent to Computing the Determinant},
  author={Seinosuke Toda},
  year={1991}
}
The main purpose of this paper is to exhibit non-algebraic problems that are computationally equivalent to computing the integer determinant. For this purpose, some graph-theoretic counting problems are shown to be equivalent to the integer determinant problem under suitable reducibilities. Those are the problems of counting the number of all paths between two nodes of a given acyclic digraph, the number of all smallest length paths between two nodes of a given undirected graph, the number of… CONTINUE READING
Highly Influential
This paper has highly influenced 12 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
60 Citations
12 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

the 5th IEEE Conference on Structure in Complexity Theory

  • the 5th IEEE Conference on Structure in…
  • 1990

A Taxonomy of Problems with Fast Parallel Algorithms

  • S A Cook
  • Information and Control
  • 1985

Similar Papers

Loading similar papers…