scientific article; zbMATH DE number 6292586
From MaRDI portal
Publication:5414556
zbMath1286.68194MaRDI QIDQ5414556
Publication date: 6 May 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2051/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Finite nilpotent groups, (p)-groups (20D15)
Related Items (8)
Loosely-abelian algebras ⋮ Satisfiability in MultiValued Circuits ⋮ A survey on varieties generated by small semigroups and a companion website ⋮ Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions ⋮ Unnamed Item ⋮ The equation solvability problem over supernilpotent algebras with Mal’cev term ⋮ Even Faster Algorithms for CSAT Over supernilpotent Algebras. ⋮ Evaluation of polynomials over finite rings via additive combinatorics
This page was built for publication: