A generalization of the zero-one principle for sorting algorithms

A generalization of the zero-one principle for sorting algorithms

0.00 Avg rating0 Votes
Article ID: iaor19911585
Country: Netherlands
Volume: 30
Issue: 2/3
Start Page Number: 265
End Page Number: 273
Publication Date: Feb 1991
Journal: Discrete Applied Mathematics
Authors: ,
Abstract:

In this paper a new general approach for the so-called ‘zero-one principle’ for sorting algorithms is described. A theorem from propositional logic that stages the connection between two-valued logic and many-valued logic is used to prove this zero-one principle. As a consequence a zero-one principle for a more general class of sorting algorithms is derived.

Reviews

Required fields are marked *. Your email address will not be published.