On the complexity of theories of permutations

DOI10.1016/0304-3975(85)90074-XzbMath0613.03002OpenAlexW1990024032MaRDI QIDQ1088647

Elisabeth Pelz

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90074-x

zbMATH Keywords

computational complexityfirst-order theorydecision algorithmtwo commuting permutations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• The complexity of logical theories
• The computational complexity of logical theories
• Alternation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of theories of permutations