Resultados de la búsqueda para Permutation Pattern: Combinatorics, Theoretical Computer...
Imagen del vendedor
Permutation Pattern
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131287899
ISBN 13: 9786131287893
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. n combinatorial mathematics and theoretical computer science, a permutation pattern is a sub-permutation of a longer permutation. The permutation written in the one-line notation is said to contain the permutation if there exists a subsequence of entries of that has the same relative order as , and in this case is said to be a pattern of , written . Otherwise, is said to avoid the permutation . The subsequence of need not consist of consecutive entries. For example, permutation = 391867452 (written in one-line notation) contains the pattern = 51342, as can be seen by considering the subsequence 91672. Such a subsequence is called a copy of . 84 pp. Englisch. Nº de ref. del artículo: 9786131287893
Comprar nuevo
EUR 34,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Permutation Pattern : Combinatorics, Theoretical Computer Science, Permutation
Impresión bajo demandaLibrería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. n combinatorial mathematics and theoretical computer science, a permutation pattern is a sub-permutation of a longer permutation. The permutation written in the one-line notation is said to contain the permutation if there exists a subsequence of entries of that has the same relative order as , and in this case is said to be a pattern of , written . Otherwise, is said to avoid the permutation . The subsequence of need not consist of consecutive entries. For example, permutation = 391867452 (written in one-line notation) contains the pattern = 51342, as can be seen by considering the subsequence 91672. Such a subsequence is called a copy of . Nº de ref. del artículo: 9786131287893
Comprar nuevo
EUR 35,89
Envío por EUR 60,72
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Permutation Pattern | Combinatorics, Theoretical Computer Science, Permutation
Impresión bajo demandaLibrería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Permutation Pattern | Combinatorics, Theoretical Computer Science, Permutation | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786131287893 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Nº de ref. del artículo: 113291187
Comprar nuevo
EUR 109,85
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen del vendedor
Permutation Pattern
Publicado por
Omniscriptum Mär 2026, 2026
ISBN 10: 6131287899
ISBN 13: 9786131287893
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. n combinatorialmathematics and theoretical computer science, a permutation pattern is asub-permutation of a longer permutation. The permutation ¿ written inthe one-line notation is said to contain the permutation ¿ if thereexists a subsequence of entries of ¿ that has the same relative order as¿, and in this case ¿ is said to be a pattern of ¿, written ¿ ¿ ¿.Otherwise, ¿ is said to avoid the permutation ¿. The subsequence of ¿need not consist of consecutive entries. For example, permutation ¿ =391867452 (written in one-line notation) contains the pattern ¿ = 51342as can be seen by considering the subsequence 91672. Such a subsequenceis called a copy of ¿.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 84 pp. Englisch. Nº de ref. del artículo: 9786131287893
Comprar nuevo
EUR 136,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles