Computer Science – Computational Complexity
Scientific paper
2003-03-14
Computer Science
Computational Complexity
Scientific paper
A polynomial algorithm is obtained for the NP-complete linear ordering
problem.
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-291810