scientific article; zbMATH DE number 3849128

zbMATH Open0534.94007MaRDI QIDQ3318682FDOQ3318682

Authors:

Publication date: 1978

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• Title not available (Why is that?)
• On the complexity of the satisfiability problem for a system of functional Boolean equations
• Title not available (Why is that?)
• On the complexity of equational problems in CNF
• Title not available (Why is that?)
• On the complexity of finding the number of solutions of systems of Boolean equations
• Boolean functional synthesis: from under the hood of solvers
• On the computational complexity of some classical equivalence relations on boolean functions

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)