Skip to main content
Download PDF
- Main
On a Distance Function for Ordered Lists
Abstract
Given two ordered lists of the same elements, we define their distance as the sum for each element of the absolute value of the difference of each element's position in the two lists. Various properties of this distance function are exhibited. In particular, a given list is "far", on the average, from a random list of the same elements.
Main Content
For improved accessibility of PDF content, download the file to your device.
Enter the password to open this PDF file:
File name:
-
File size:
-
Title:
-
Author:
-
Subject:
-
Keywords:
-
Creation Date:
-
Modification Date:
-
Creator:
-
PDF Producer:
-
PDF Version:
-
Page Count:
-
Page Size:
-
Fast Web View:
-
Preparing document for printing…
0%