Results 1 to 10 of about 103,432 (283)
The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The Permutation Pattern Matching problem, asking whether a pattern permutation $\pi$ is contained in a permutation $\tau$, is known to be NP-complete. In this paper we present two polynomial time algorithms for special cases.
Michael H. Albert +3 more
doaj +3 more sources
Pattern Avoidance in Reverse Double Lists [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal.
Monica Anderson +3 more
doaj +3 more sources
Enumeration of Corners in Tree-like Tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative ...
Alice L. L. Gao +3 more
doaj +3 more sources
On the parameterized complexity of the median and closest problems under some permutation metrics [PDF]
Algorithms for Molecular BiologyGenome rearrangements are events where large blocks of DNA exchange places during evolution. The analysis of these events is a promising tool for understanding evolutionary genomics, providing data for phylogenetic reconstruction based on genome ...
Luís Cunha, Ignasi Sau, Uéverton Souza
doaj +2 more sources
Permutation Polynomial Interleaved DFT-s-OFDM
IEEE Open Journal of the Communications Society, 2023 We propose frequency-domain interleaver for discrete Fourier transform spread orthogonal division multiplexing (DFT-s-OFDM) based on a linear- or quadratic permutation polynomial (LPP/QPP).
Fredrik Berggren, Branislav M. Popovic
doaj +1 more source
Quasi-permutation polynomials [PDF]
Czechoslovak Mathematical Journal, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Laohakosol, Vichian +1 more
openaire +2 more sources
Permutation polynomials and group permutation polynomials [PDF]
Bulletin of the Australian Mathematical Society, 2001 Permutation polynomials of the form xτf (x3) over a finite field give rise to group permutation polynomials. We give a group theoretic criterion and some other criteria in terms of symmetric functions and power functions.
Park, Young Ho, Lee, June Bok
openaire +1 more source
Solving Simple Stochastic Games with Few Random Vertices [PDF]
Logical Methods in Computer Science, 2009 Simple stochastic games are two-player zero-sum stochastic games with turn-based moves, perfect information, and reachability winning conditions. We present two new algorithms computing the values of simple stochastic games.
Hugo Gimbert, Florian Horn
doaj +1 more source
LINEAR CODE THROUGH POLYNOMIAL MODULO Z [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2012 A polynomial p(x)= a + a x + …+ a x is said to be a permutation polynomial over a finite ring R If P permute the elements of R . where R is the ring ( Z , + , ) .
MAKARIM ABDULWAHIDE
doaj +1 more source
A Key-Recovery Side-Channel Attack on Classic McEliece Implementations
Transactions on Cryptographic Hardware and Embedded Systems, 2022 In this paper, we propose the first key-recovery side-channel attack on Classic McEliece, a KEM finalist in the NIST Post-quantum Cryptography Standardization Project.
Qian Guo +2 more
doaj +3 more sources