Satisfiability in multi-valued circuits

DOI10.1145/3209108.3209173zbMath1497.68358arXiv1710.08163OpenAlexW2963612844MaRDI QIDQ5145331

Paweł M. Idziak, Jacek Krzaczkowski

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.08163

zbMATH Keywords

solving equationscircuit satisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Congruence modularity, congruence distributivity (08B10) Networks and circuits as models of computation; circuit complexity (68Q06) Computational aspects of satisfiability (68R07)

Related Items (6)

Supernilpotent Taylor algebras are nilpotent ⋮ Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Even Faster Algorithms for CSAT Over supernilpotent Algebras. ⋮ Supernilpotence need not imply nilpotence

This page was built for publication: Satisfiability in multi-valued circuits