The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups

Gustav Nordh

Type: Book-Chapter

Publication Date: 2004-01-01

Citations: 3

DOI: https://doi.org/10.1007/978-3-540-28629-5_28

View Publication

Locations

Lecture notes in computer science - View

Similar Works

Action	Title	Year	Authors
+	The equivalence and equation solvability problems over some finite groups	2014	Attila Földvári
+ PDF Chat	The extended equivalence and equation solvability problems for groups	2011	Gábor Horváth Csaba Szabó
+	Equivalence and equation solvability problems for the alternating group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mstyle mathvariant="bold"><mml:mi>A</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>	2012	Gábor Horváth Csaba Szabó
+	Linear Diophantine Equations, Group CSPs, and Graph Isomorphism	2017	Christoph Berkholz Martin Grohe
+	Linear Diophantine Equations, Group CSPs, and Graph Isomorphism	2016	Christoph Berkholz Martin Grohe
+ PDF Chat	The complexity of the equivalence and equation solvability problems over nilpotent rings and groups	2011	Gábor Horváth
+ PDF Chat	The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete	2008	Olga Kharlampovich Igor Lysenok Alexei Myasnikov Nicholas Touikan
+ PDF Chat	Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time	2020	Roman Nedela Ilia Ponomarenko
+	The complexity of the equation solvability and equivalence problems over finite groups	2019	Attila Földvári Gábor Horváth
+	The isomorphism problem for plain groups is in $\Sigma_3^{\mathsf{P}}$	2021	Heiko Dietrich Murray Elder Adam Piggott Youming Qiao A. Weiss
+	Beating the Generator-Enumeration Bound for $p$-Group Isomorphism	2013	David J. Rosenbaum Fabian Wagner
+	Beating the Generator-Enumeration Bound for $p$-Group Isomorphism	2013	David J. Rosenbaum Fabian Wagner
+ PDF Chat	SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS	2007	László Zádori
+	Equivalence of Equations	2012	Jason Har Kumar K. Tamma
+	Hardness of equations over finite solvable groups under the exponential time hypothesis	2020	A. Weiss
+	Hardness of Equations over Finite Solvable Groups Under the Exponential Time Hypothesis.	2020	A. Weiss
+ PDF Chat	The Complexity of Boolean Constraint Isomorphism	2004	Elmar Böhler Edith Hemaspaandra Steffen Reith Heribert Vollmer
+	The equivalence problem	2006	A. Karlhede
+	The Complexity of Boolean Constraint Isomorphism	2003	Elmar Böhler Edith Hemaspaandra Steffen Reith Heribert Vollmer
+ PDF Chat	Complexity classes of equivalence problems revisited	2011	Lance Fortnow Joshua A. Grochow

Works That Cite This (1)

Action	Title	Year	Authors
+	Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture	2006	Ondřej Klíma Benoît Larose Pascal Tesson

Works Cited by This (5)

Action	Title	Year	Authors
+	The Complexity of Counting Solutions to Systems of Equations over Finite Semigroups	2004	Gustav Nordh Peter Jönsson
+	Satisfiability of Systems of Equations over Finite Monoids	2001	Cristopher Moore Pascal Tesson Denis Thérien
+	A note on the graph isomorphism counting problem	1979	Rudolf Mathon
+ PDF Chat	Equivalence and Isomorphism for Boolean Constraint Satisfaction	2002	Elmar Böhler Edith Hemaspaandra Steffen Reith Heribert Vollmer
+ PDF Chat	The Complexity of Boolean Constraint Isomorphism	2004	Elmar Böhler Edith Hemaspaandra Steffen Reith Heribert Vollmer