On the complexity of the satisfiability problem for a system of functional Boolean equations
From MaRDI portal
Publication:5263821
DOI10.1134/S1990478913030071zbMATH Open1324.68051OpenAlexW2032626843MaRDI QIDQ5263821FDOQ5263821
Authors: V. S. 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
Recommendations
- scientific article; zbMATH DE number 3849128
- scientific article; zbMATH DE number 1943080
- On complexity of problem of satisfiability for systems of countable-valued functional equations
- On the complexity of finding the number of solutions of systems of Boolean equations
- scientific article; zbMATH DE number 6004972
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Functional equations for the functions of real variables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On complexity of problem of satisfiability for systems of countable-valued functional equations
- On solutions to systems of automata-type functional equations
- On the complexity of finding the number of solutions of systems of Boolean equations
- On solvability of Boolean equations
- Functions from Schaefer classes having negations belonging to other Schaefer classes
- ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY
This page was built for publication: On the complexity of the satisfiability problem for a system of functional Boolean equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263821)
