On the complexity of the satisfiability problem for a system of functional Boolean equations

DOI10.1134/S1990478913030071zbMath1324.68051OpenAlexW2032626843MaRDI QIDQ5263821

Valentina Sergeevna Fedorova

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478913030071

zbMATH Keywords

complexitysatisfiabilityfunctional Boolean equation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Functional equations for the functions of real variables ⋮ On complexity of problem of satisfiability for systems of countable-valued functional equations

This page was built for publication: On the complexity of the satisfiability problem for a system of functional Boolean equations