Solution of the Linear Ordering Problem (NP=P)

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

A polynomial algorithm is obtained for the NP-complete linear ordering
problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Solution of the Linear Ordering Problem (NP=P) 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 Solution of the Linear Ordering Problem (NP=P), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution of the Linear Ordering Problem (NP=P) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-291810

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.