Finding and Counting Permutations via CSPs

Berendsohn, Benjamin Aram; Kozma, László; Marx, Dániel

doi:10.1007/s00453-021-00812-z

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Finding and Counting Permutations via CSPs

MPS-Authors

/persons/resource/persons250066

Marx, Dániel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

Berendsohn2021_Article_FindingAndCountingPermutations.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Berendsohn, B. A., Kozma, L., & Marx, D. (2021). Finding and Counting Permutations via CSPs. Algorithmica, 83, 2552-2577. doi:10.1007/s00453-021-00812-z.

Cite as: https://hdl.handle.net/21.11116/0000-0008-3403-A

Abstract

There is no abstract available