The complexity of finding minimum-length generator sequences
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- scientific article; zbMATH DE number 3032896 (Why is no real title available?)
- Relationships between nondeterministic and deterministic tape complexities
- The minimum-length generator sequence problem is NP-hard
Cited in
(58)- Computing short generator sequences
- Sorting by bounded block-moves
- Hash functions and Cayley graphs
- Bisection width of transposition graphs
- Sorting permutations with transpositions in \(O(n^3)\) amortized time
- Swapping colored tokens on graphs
- Diameter bounds and recursive properties of Full-Flag Johnson graphs
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Cyclic group blocking polyhedra
- Length-weighted \(\lambda\)-rearrangement distance
- Sorting a permutation by best short swaps
- Approximation algorithms for sorting permutations by length-weighted short rearrangements
- Exploiting pseudo-locality of interchange distance
- Cyclic shift problems on graphs
- Approximation algorithms for sorting permutations by extreme block-interchanges
- Swapping labeled tokens on graphs
- Sorting on graphs by adjacent swaps using permutation groups
- How to sort by walking and swapping on paths and trees
- An approximation algorithm for genome sorting by reversals to recover all adjacencies
- Multiple genome rearrangement by swaps and by element duplications
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
- A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
- Cryptographic hash functions and expander graphs: the end of the story?
- Task swapping networks in distributed systems
- The time complexity of the token swapping problem and its parallel variants
- Growth in SL2 over finite fields
- On minimizing the lengths of checking sequences
- Swapping Colored Tokens on Graphs
- Edit Distances and Factorisations of Even Permutations
- The time complexity of permutation routing via matching, token swapping and a variant
- Upper bounds for sorting permutations with a transposition tree
- Exact upper bound for sorting \(R_n\) with LE
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- On the qubit routing problem
- On the strictness of a bound for the diameter of Cayley graphs generated by transposition trees
- Sorting with fixed-length reversals
- Sorting by prefix block-interchanges
- Token Swapping on Trees
- scientific article; zbMATH DE number 7765413 (Why is no real title available?)
- Hypercube embeddings and Cayley graphs generated by transpositions
- An algebraic model for inversion and deletion in bacterial genome rearrangement
- Particle computation: complexity, algorithms, and logic
- Reconfiguration and enumeration of optimal cyclic ladder lotteries
- Finding Antimagic Labelings of Trees by Evolutionary Search
- Automorphism groups of Cayley graphs generated by general transposition sets
- On the diameters of friends-and-strangers graphs
- Sorting permutations by block-interchanges
- On symmetric games with respect to a permutation group
- Finding cycle types in permutation groups with few generators
- Find routes on a doughnut
- The minimum number of discriminant equations for a symmetric game
- Parallel token swapping for qubit routing
- Reconfiguration and enumeration of optimal cyclic ladder lotteries
- Exploiting pseudo-locality of interchange distance
- Hardness of token swapping on trees
- Membership problems in finite groups
- Parameterized complexity of factorization problems
- A review of metrics on permutations for search landscape analysis
This page was built for publication: The complexity of finding minimum-length generator sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058290)
