compression algorithm is NP complete problem?
- From: jrefactors@xxxxxxxxxxx
- Date: 14 Apr 2005 00:33:23 -0700
I always want to understand more on practical applications of NP
complete problem. My understanding of NP complete problem is that the
problems cannot be solved in polynomial running time in deterministic
machine. Correct?
I heard someone say compression algorithm is NP complete problem. And
different compression software such as Winzip, pkzip, etc.. compress
the same file in different size, and there is no minimum size that can
compress. I still don't understand how compression algorithm is NP
complete problem.
Please advise. thanks!!
.
- Follow-Ups:
- Re: compression algorithm is NP complete problem?
- From: Mauricio Nivaldo Andres Monsalve Moreno
- Re: compression algorithm is NP complete problem?
- From: Torben Ægidius Mogensen
- Re: compression algorithm is NP complete problem?
- Prev by Date: Re: What computing is all about
- Next by Date: Re: compression algorithm is NP complete problem?
- Previous by thread: Re: What computing is all about
- Next by thread: Re: compression algorithm is NP complete problem?
- Index(es):
Relevant Pages
|