Satisfiability of circuits and equations over finite malcev algebras

DOI10.4230/LIPICS.STACS.2022.37MaRDI QIDQ6490983zbMATH OpenFDO

Authors Paweł M. Idziak, Piotr Kawałek, Jacek Krzaczkowski

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.37

zbMATH Keywords

circuit satisfiabilityexponential time hypothesissolving equations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(2)

• Circuit equivalence in 2-nilpotent algebras
• Nonuniform deterministic finite automata over finite algebraic structures

This page was built for publication: Satisfiability of circuits and equations over finite malcev algebras

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