External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Inapproximability of Counting Permutation Patterns

Michal Opler. Inapproximability of Counting Permutation Patterns. In Sayan Bhattacharya, Danupon Nanongkai, Michael Benedikt, Gabriele Puppis, editors, 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026. Volume 374 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. [doi]

Authors

Michal Opler

This author has not been identified. Look up 'Michal Opler' in Google
runs on