Displaying 8 results from an estimated 8 matches for "antisymmetry".
2014 Jan 17
6
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...r relation on functions set.
To be sure, that functions could be comparable that way, we have to
prove that order relation is possible on all comparison stage.
The last one is possible, if for each comparison stage we implement has
next properties:
* reflexivity (a <= a, a == a, a >= a),
* antisymmetry (if a <= b and b <= a then a == b),
* transitivity (a <= b and b <= c, then a <= c)
* asymmetry (if a < b, then a > b or a == b).
Once we have defined order relation we can store all the functions in
binary tree and perform lookup in O(log(N)) time.
This post has two attach...
2014 Jan 22
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...could be comparable that way, we have to
>> prove that order relation is possible on all comparison stage.
>>
>> The last one is possible, if for each comparison stage we implement has
>> next properties:
>> * reflexivity (a <= a, a == a, a >= a),
>> * antisymmetry (if a <= b and b <= a then a == b),
>> * transitivity (a <= b and b <= c, then a <= c)
>> * asymmetry (if a < b, then a > b or a == b).
>>
>> Once we have defined order relation we can store all the functions in
>> binary tree and perform look...
2014 Jan 21
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...ons could be comparable that way, we have to
>> prove that order relation is possible on all comparison stage.
>>
>> The last one is possible, if for each comparison stage we implement has
>> next properties:
>> * reflexivity (a <= a, a == a, a >= a),
>> * antisymmetry (if a <= b and b <= a then a == b),
>> * transitivity (a <= b and b <= c, then a <= c)
>> * asymmetry (if a < b, then a > b or a == b).
For asymmetry, I think it’s: if a < b, then not a > b and not a == b.
>>
>> Once we have defined order relat...
2014 Jan 31
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...for each
> comparison
> stage we
> implement has
> next properties:
> * reflexivity (a <= a, a == a, a >= a),
> * antisymmetry (if a <= b and b <= a
> then a == b),
> * transitivity (a <= b and b <= c, then
> a <= c)
> * asymmetry (if a < b, then a > b or a
> == b).
>
>...
2014 Feb 03
4
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...;> stage we
>>> implement has
>>> next properties:
>>> * reflexivity (a <= a, a == a, a >= a),
>>> * antisymmetry (if a <= b and b <= a
>>> then a == b),
>>> * transitivity (a <= b and b <= c, then
>>> a <= c)
>>> * asymmetry (if a < b, then a > b or a
>>> =...
2014 Feb 27
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...implement has
> next properties:
> * reflexivity (a <= a,
> a == a, a >= a),
> * antisymmetry (if a <=
> b and b <= a
> then a == b),
> * transitivity (a <= b
> and b <= c, then
> a <= c)
>...
2014 Jan 28
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...order relation is possible on all comparison stage.
>>>>
>>>> The last one is possible, if for each comparison stage we
>>>> implement has
>>>> next properties:
>>>> * reflexivity (a <= a, a == a, a >= a),
>>>> * antisymmetry (if a <= b and b <= a then a == b),
>>>> * transitivity (a <= b and b <= c, then a <= c)
>>>> * asymmetry (if a < b, then a > b or a == b).
>>>>
>>>> Once we have defined order relation we can store all the functions in
>...
2014 Jan 30
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...> The last one is possible, if for each comparison
> stage we
> implement has
> next properties:
> * reflexivity (a <= a, a == a, a >= a),
> * antisymmetry (if a <= b and b <= a then a == b),
> * transitivity (a <= b and b <= c, then a <= c)
> * asymmetry (if a < b, then a > b or a == b).
>
> Once we have defined order relation we can store
>...