Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska <triska@xxxxxx>
- Date: Mon, 25 Sep 2006 18:30:47 +0200
"eKo1" <berndlosert@xxxxxxxxxxxx> writes:
OH!? That's interesting. Is it because
It's because we don't know when to stop comparing.
How about floating point numbers?
There are only finitely many floating point numbers in any
implementation; enumerate them to reduce to the integer case.
Best wishes,
Markus Triska
.
- References:
- On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska
- Re: On the complexity of determining whether n numbers are distinct
- From: eKo1
- On the complexity of determining whether n numbers are distinct
- Prev by Date: Best-first search metaheuristic help
- Next by Date: Re: On the complexity of determining whether n numbers are distinct
- Previous by thread: Re: On the complexity of determining whether n numbers are distinct
- Next by thread: Re: On the complexity of determining whether n numbers are distinct
- Index(es):
Relevant Pages
|