scientific article
From MaRDI portal
zbMath0638.68073MaRDI QIDQ3779765
Pierre Péladeau, Denis Thérien
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The complexity of the equation solvability problem over nilpotent groups, The complexity of the equivalence and equation solvability problems over nilpotent rings and groups., Learning Read-Constant Polynomials of Constant Degree Modulo Composites, Learning read-constant polynomials of constant degree modulo composites, Extensions to Barrington's M-program model, An Algebraic Perspective on Boolean Function Learning, An ergodic theorem for read-once non-uniform deterministic finite automata, The complexity of solving equations over finite groups, Non-uniform automata over groups
