The Computational Complexity of Computing the Permanent of a Matrix

Details The Computational Complexity of Computing the Permanent of a Matrix The Computational Complexity of Computing the Permanent of a Matrix

2003-05-19

arxiv.org/abs/cs/0305035v26

Computer Science

Computational Complexity

1 page

Scientific paper

In this note, we show that there is no deterministic and exact algorithm that
computes the permanent of a matrix in polynomial-time.

Affiliated with

Also associated with

No associations

Rating

The Computational Complexity of Computing the Permanent of a Matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Computational Complexity of Computing the Permanent of a Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Computational Complexity of Computing the Permanent of a Matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-153895