Geodesic
Einige Bemerkungen zu Gleichheitstests und deren Komplexität
Séminaire lotharingien de combinatoire, Tome 17 (1987)

Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website

In the - sit venia verbo - Art of Programming, one is frequently faced with the task to determine if elements in a list agree with each other; for example, when a magma given by its Cayley table is checked for cancelability, or when in a data base, e.g. of personnel files, equal attributes have to be detected. Essentially, this task amounts to detect whether a finite sequence of positive integers has equal elements. We elaborate on the complexity of this problem. 

@article{SLC_1987_17_a6,
     author = {Wilfried Lex},
     title = {Einige {Bemerkungen} zu {Gleichheitstests} und deren {Komplexit\"at}},
     journal = {S\'eminaire lotharingien de combinatoire},
     publisher = {mathdoc},
     volume = {17},
     year = {1987},
     url = {http://geodesic.mathdoc.fr/item/SLC_1987_17_a6/}
}
TY  - JOUR
AU  - Wilfried Lex
TI  - Einige Bemerkungen zu Gleichheitstests und deren Komplexität
JO  - Séminaire lotharingien de combinatoire
PY  - 1987
VL  - 17
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SLC_1987_17_a6/
ID  - SLC_1987_17_a6
ER  - 
%0 Journal Article
%A Wilfried Lex
%T Einige Bemerkungen zu Gleichheitstests und deren Komplexität
%J Séminaire lotharingien de combinatoire
%D 1987
%V 17
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SLC_1987_17_a6/
%F SLC_1987_17_a6
Wilfried Lex. Einige Bemerkungen zu Gleichheitstests und deren Komplexität. Séminaire lotharingien de combinatoire, Tome 17 (1987). http://geodesic.mathdoc.fr/item/SLC_1987_17_a6/