Permutation patterns are hard to count (Q4575645)

From MaRDI portal

Revision as of 12:17, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Permutation patterns are hard to count

scientific article; zbMATH DE number 6903943

Language	Label	Description	Also known as
English	Permutation patterns are hard to count	scientific article; zbMATH DE number 6903943

Statements

scholarly article

0 references

Permutation patterns are hard to count (English)

0 references

Scott M. Garrabrant

0 references

0 references

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms

0 references

publication date

16 July 2018

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/1.9781611974331.ch66

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4575645

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4575645&oldid=18719772"