The complexity of equivalence and isomorphism of systems of equations over finite groups

DOI10.1016/J.TCS.2005.07.018zbMATH Open1079.68044OpenAlexW1984697719MaRDI QIDQ2575758FDOQ2575758

Gustav Nordh

Publication date: 6 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.07.018

zbMATH Keywords

Computational complexityFinite groupsGraph isomorphismSystems of equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On truth-table reducibility to SAT
• The complexity of solving equations over finite groups
• Dichotomies in the complexity of solving systems of equations over finite semigroups
• The Formula Isomorphism Problem
• A note on the graph isomorphism counting problem
• Computing and Combinatorics
• STACS 2004

Cited In (5)

• On the expression complexity of equivalence and isomorphism of primitive positive formulas
• Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
• Dichotomies in the complexity of solving systems of equations over finite semigroups
• The complexity of the equation solvability problem over semipattern groups
• Cost of equivalence relations and groups

This page was built for publication: The complexity of equivalence and isomorphism of systems of equations over finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575758)