On the asymmetric complexity of the group-intersection problem (Q963437): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2008.02.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048980245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Modular Graph Automorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonadaptive NC checker for permutation group intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Bounded Queries to Arbitrary NP Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity theory companion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617749 / rank
 
Normal rank

Latest revision as of 17:33, 2 July 2024

scientific article
Language Label Description Also known as
English
On the asymmetric complexity of the group-intersection problem
scientific article

    Statements

    On the asymmetric complexity of the group-intersection problem (English)
    0 references
    0 references
    19 April 2010
    0 references
    0 references
    computational complexity
    0 references
    permutation groups
    0 references
    0 references