TU Berlin

FG Kombinatorische Optimierung und Graphenalgorithmen1989

COGA 5-Wheel

Inhalt

zur Navigation

Preprints 1989

A Generalization of the Zero–One Principle for Sorting Algorithms
Zitatschlüssel Report-217-1989
Autor Dorothea Wagner and Frank Wagner
Seiten 265-273
Jahr 1989
Journal Discrete Applied Mathematics, 1991
Jahrgang 30
Nummer 217
Institution Technische Universität Berlin, Institut für Mathematik
Zusammenfassung 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 states 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.
Typ der Publikation Preprint
Download Bibtex Eintrag

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe