On the asymmetric complexity of the group-intersection problem
From MaRDI portal
Publication:963437
DOI10.1016/j.ipl.2008.02.015zbMath1186.68222OpenAlexW2048980245MaRDI QIDQ963437
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.015
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- A note on the graph isomorphism counting problem
- The Complexity of Modular Graph Automorphism
- Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
- On the Structure of Bounded Queries to Arbitrary NP Sets
- The complexity theory companion
- A nonadaptive NC checker for permutation group intersection
This page was built for publication: On the asymmetric complexity of the group-intersection problem
