On the asymmetric complexity of the group-intersection problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 512806
- Graph isomorphism problem and 2-closed permutation groups
- GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems
- scientific article; zbMATH DE number 475362
Cites work
- scientific article; zbMATH DE number 475362 (Why is no real title available?)
- scientific article; zbMATH DE number 477971 (Why is no real title available?)
- scientific article; zbMATH DE number 512806 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- A nonadaptive NC checker for permutation group intersection
- A note on the graph isomorphism counting problem
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On the Structure of Bounded Queries to Arbitrary NP Sets
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- The complexity of modular graph automorphism
- The complexity theory companion
Cited in
(2)
This page was built for publication: On the asymmetric complexity of the group-intersection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963437)
