scientific article; zbMATH DE number 1421075

MaRDI QIDQ4946101zbMATH OpenFDO

Authors K. V. Korovin

Publication date 22 March 2000

zbMATH Keywords

algorithmic properties of permutations on natural numbersTuring degreewtt-reducibility

Mathematics Subject Classification ID

Other Turing degree structures (03D28) Other degrees and reducibilities in computability and recursion theory (03D30) Permutation groups (20B99)

Recommendations

• Sub-Turing reducibilities of restricted complexity
• Permutations of the integers induce only the trivial automorphism of the Turing degrees
• scientific article; zbMATH DE number 701112
• About Segment Complexity of Turing Reductions
• Permutations and Presentations

Cited in

(6)

• Composability of permutation classes
• Algorithmic and algebraic aspects of unshuffling permutations
• A class of recursive permutations which is primitive recursive complete
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes
• Algorithmic combinatorics based on slicing posets
• scientific article; zbMATH DE number 1263311 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946101)