Metraipolis › archive › dc_7eb6d01427f7

Faster #PPM from faster #3SAT — arXiv:2610.41048

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41048
License (as archived)
CC0-1.0
Archived
2026-11-02T05:06:44.288Z
SHA-256 of the archived text
9daab8701eacf6429350b6b7d71b9cb3ea63f3bd17952ae62ea1f19538108192
Stable URL of this page
https://metraipolis.com/documento/dc_7eb6d01427f7

How to cite

Faster #PPM from faster #3SAT — arXiv:2610.41048 — arXiv (en), https://arxiv.org/abs/2610.41048 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7eb6d01427f7 (Metraipolis archive dc_7eb6d01427f7, sha256 9daab8701eacf6429350b6b7d71b9cb3ea63f3bd17952ae62ea1f19538108192)
BibTeX
@misc{dc7eb6d01427f7,
  title = {Faster #PPM from faster #3SAT — arXiv:2610.41048},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41048},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7eb6d01427f7; sha256 9daab8701eacf6429350b6b7d71b9cb3ea63f3bd17952ae62ea1f19538108192},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41048. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The counting variant (#PPM) of the permutation pattern matching (PPM) problem asks for the number of occurrences of a permutation pattern in a host permutation of length $n$. The problem admits faster algorithms than the trivial $O^*(2^n)$ time enumeration; the best known running time, for both PPM and #PPM, is $O(1.415^n)$ (Gawrychowski and Rzepecki). It is also known that PPM is ETH-hard: an algorithm with running time $2^{o(n/\log{n})}$ would imply a subexponential algorithm for 3SAT (Jelínek, Opler, and Pekárek). We give a reduction in the opposite direction, showing that an algorithm for counting satisfying assignments of a 3-CNF formula (#3SAT) in time $2^{O({n}/{f(n)})}$, where $n$ is the number of variables, yields an algorithm for #PPM with running time $2^{O({n \sqrt{\log{f(n)}/{f(n)}}})}$. In particular, the recently claimed refutation of ETH by OpenAI implies a #3SAT algorithm with an improvement factor $f(n) \in \Omega(\sqrt{\log{n}}/\log\log{n})$ in the exponent; this yields, through our reduction, a subexponential algorithm for #PPM.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2610.41048 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:50:28.134Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).