Pages that link to "Item:Q1854566"

The following pages link to The complexity of solving equations over finite groups (Q1854566):

Displaying 40 items.

• Loosely-abelian algebras (Q292836) (← links)
• On complexity of multiplication in finite soluble groups. (Q468715) (← links)
• On solvability of systems of polynomial equations (Q539980) (← links)
• Some applications of higher commutators in Mal'cev algebras (Q607465) (← links)
• Equivariant unification (Q616849) (← links)
• Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
• Dichotomies in the complexity of solving systems of equations over finite semigroups (Q870451) (← links)
• Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
• Inapproximability results for equations over infinite groups (Q974745) (← links)
• The complexity of some reachability problems for a system on a finite group (Q1262244) (← links)
• The complexity of the equation solvability problem over nilpotent groups (Q1682080) (← links)
• A discrete homotopy theory for binary reflexive structures (Q1763635) (← links)
• Computational complexity and 3-manifolds and zombies (Q1785090) (← links)
• Inapproximability results for equations over finite groups (Q1884871) (← links)
• Solving a fixed number of equations over finite groups (Q2226983) (← links)
• Notes on extended equation solvability and identity checking for groups (Q2330072) (← links)
• Learning expressions and programs over monoids (Q2490112) (← links)
• The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758) (← links)
• The complexity of the equation solvability problem over semipattern groups (Q2986663) (← links)
• TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS (Q3067781) (← links)
• Nonsingular systems of two length three equations over a group (Q3356522) (← links)
• Detecting fast solvability of equations via small powerful Galois groups (Q3450274) (← links)
• Linear Diophantine Equations, Group CSPs, and Graph Isomorphism (Q4575758) (← links)
• The equation solvability problem over supernilpotent algebras with Mal’cev term (Q4687481) (← links)
• The complexity of the equation solvability and equivalence problems over finite groups (Q4960464) (← links)
• Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. (Q5005117) (← links)
• The Complexity of Synthesis of b-Bounded Petri Nets (Q5025061) (← links)
• Satisfiability in MultiValued Circuits (Q5080482) (← links)
• Even Faster Algorithms for CSAT Over supernilpotent Algebras. (Q5089225) (← links)
• (Q5092435) (← links)
• (Q5094140) (← links)
• Solving equation systems in ω-categorical algebras (Q5163170) (← links)
• Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
• Mathematical Foundations of Computer Science 2004 (Q5311113) (← links)
• SOLVABILITY OF SYSTEMS OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5386972) (← links)
• TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5483456) (← links)
• On properties of multiaffine predicates on a finite set (Q6051969) (← links)
• Constrained inhomogeneous spherical equations: average-case hardness (Q6601473) (← links)
• Equation satisfiability in solvable groups (Q6614610) (← links)
• Complexity of modular circuits (Q6649462) (← links)