Re: On the complexity of determining whether n numbers are distinct
- From: Markus Triska <triska@xxxxxx>
- Date: Mon, 25 Sep 2006 02:28:44 +0200
"eKo1" <berndlosert@xxxxxxxxxxxx> writes:
1. We don't know a priori the size of the vector.
We enlarge it on demand.
2. This doesn't handle real numbers.
There's no algorithm for your problem over reals, since their equality
is undecidable.
Best wishes,
Markus Triska
.
- Follow-Ups:
- 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
- On the complexity of determining whether n numbers are distinct
- Prev by Date: Re: An algorithm with Minimum vertex cover without considering its performance
- Next by Date: Re: (Probably flawed) Polynomial time Graph Isomorphism
- 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
|