author: florian sikora

SOFSEM 2021: Theory and Practice of Computer Science: 47th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021, Proceedings

... { 8 * ( K ) | CK , KEC } = 1 - inf { 8 * ( K ) | CK , K EC } ( 2 ) holds . On the other hand , L is measurable if and ... Step 1 set i O and l = 0 . Step 2 check L ( A ) is co - infinite ( i.e. , the complement L ( A ) is infinite ) or not ...

SOFSEM 2020: Theory and Practice of Computer Science: 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020, Proceedings

... OPPM problem based on those algorithms by Jargalsaikhan et al. [4] and Vishkin [8]. Adapting an exact matching algorithm to OPPM is no trivial task. The difficulty of OPPM mainly comes from the fact that we cannot determine the ...

This website uses cookies and collects data for optimal performance. Your continued use signifies agreement to our Privacy Policy.