scientific article; zbMATH DE number 3849128

MaRDI QIDQ3318682zbMATH OpenFDO

Authors

Publication date 1978

zbMATH Keywords

time complexitynondeterministic Turing machineBoolean functional equationexponentially hard problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional equations for functions with more general domains and/or ranges (39B52)

Recommendations

• On the complexity of the satisfiability problem for a system of functional Boolean equations
• On the complexity of finding the number of solutions of systems of Boolean equations
• scientific article; zbMATH DE number 6004972
• On solvability of Boolean equations
• scientific article; zbMATH DE number 1943080

Cited in

(8)

• scientific article; zbMATH DE number 1196693 (Why is no real title available?)
• On the computational complexity of some classical equivalence relations on boolean functions
• On the complexity of finding the number of solutions of systems of Boolean equations
• On the complexity of the satisfiability problem for a system of functional Boolean equations
• scientific article; zbMATH DE number 6004972 (Why is no real title available?)
• Boolean functional synthesis: from under the hood of solvers
• scientific article; zbMATH DE number 5205533 (Why is no real title available?)
• On the complexity of equational problems in CNF

This page was built for publication:

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