On the asymmetric complexity of the group-intersection problem

DOI10.1016/J.IPL.2008.02.015zbMATH Open1186.68222OpenAlexW2048980245MaRDI QIDQ963437FDOQ963437

Authors: Takunari Miyazaki 

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

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

zbMATH Keywords

computational complexitypermutation groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis
• Title not available (Why is that?)
• Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The complexity theory companion
• The complexity of modular graph automorphism
• A note on the graph isomorphism counting problem
• Title not available (Why is that?)
• On the Structure of Bounded Queries to Arbitrary NP Sets
• A nonadaptive NC checker for permutation group intersection

Cited In (2)

• Title not available (Why is that?)
• Approximation by juntas in the symmetric group, and forbidden intersection problems

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)