The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984697719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Formula Isomorphism Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On truth-table reducibility to SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of solving equations over finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomies in the complexity of solving systems of equations over finite semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287502 / 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: Q4779171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259991 / rank
 
Normal rank

Latest revision as of 13:47, 11 June 2024

scientific article
Language Label Description Also known as
English
The complexity of equivalence and isomorphism of systems of equations over finite groups
scientific article

    Statements

    The complexity of equivalence and isomorphism of systems of equations over finite groups (English)
    0 references
    0 references
    6 December 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Graph isomorphism
    0 references
    Computational complexity
    0 references
    Systems of equations
    0 references
    Finite groups
    0 references
    0 references