A nonadaptive NC checker for permutation group intersection

DOI10.1016/S0304-3975(00)00159-6zbMath0974.68022OpenAlexW1971065390MaRDI QIDQ5941295

Jacobo Toran, V. Arvind

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00159-6

zbMATH Keywords

permutation groupsparallel algorithmsinteractive proofsprogram checking

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) General topics in the theory of software (68N01)

Related Items (3)

On the Complexity of the Hidden Subgroup Problem ⋮ ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM ⋮ On the asymmetric complexity of the group-intersection problem

Cites Work

• Arithmetization: A new method in structural complexity theory
• Group-theoretic algorithms and graph isomorphism
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Parallel concepts in graph theory
• Efficient checkers for number-theoretic computations
• IP = PSPACE
• Designing programs that check their work
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A nonadaptive NC checker for permutation group intersection